/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/4_plus_thr/m9.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:47:09,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:47:09,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:47:09,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:47:09,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:47:09,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:47:09,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:47:09,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:47:09,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:47:09,191 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:47:09,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:47:09,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:47:09,193 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:47:09,194 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:47:09,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:47:09,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:47:09,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:47:09,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:47:09,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:47:09,195 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:47:09,195 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:47:09,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:47:09,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:47:09,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:47:09,441 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:47:09,442 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:47:09,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m9.c.bpl [2025-02-17 22:47:09,443 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m9.c.bpl' [2025-02-17 22:47:09,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:47:09,464 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:47:09,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:47:09,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:47:09,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:47:09,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,483 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:47:09,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:47:09,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:47:09,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:47:09,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:47:09,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:47:09,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:47:09,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:47:09,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:47:09,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/1) ... [2025-02-17 22:47:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:09,530 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-02-17 22:47:09,533 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-02-17 22:47:09,555 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:47:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:47:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:47:09,555 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:47:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:47:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:47:09,555 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:47:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:47:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:47:09,556 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:47:09,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:47:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:47:09,556 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:47:09,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:47:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:47:09,556 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:47:09,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:47:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:47:09,558 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:47:09,595 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:47:09,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:47:09,672 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:47:09,672 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:47:09,681 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:47:09,681 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:47:09,682 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:47:09 BoogieIcfgContainer [2025-02-17 22:47:09,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:47:09,683 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:47:09,684 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:47:09,688 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:47:09,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:47:09,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:47:09" (1/2) ... [2025-02-17 22:47:09,690 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39d785f9 and model type m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:47:09, skipping insertion in model container [2025-02-17 22:47:09,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:47:09,690 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:47:09" (2/2) ... [2025-02-17 22:47:09,691 INFO L363 chiAutomizerObserver]: Analyzing ICFG m9.c.bpl [2025-02-17 22:47:09,776 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:47:09,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 123 flow [2025-02-17 22:47:09,841 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-02-17 22:47:09,845 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:47:09,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 5/34 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-02-17 22:47:09,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 123 flow [2025-02-17 22:47:09,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 98 flow [2025-02-17 22:47:09,866 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:47:09,866 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:47:09,866 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:47:09,866 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:47:09,866 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:47:09,867 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:47:09,867 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:47:09,867 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:47:09,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:47:10,201 INFO L131 ngComponentsAnalysis]: Automaton has 615 accepting balls. 2358 [2025-02-17 22:47:10,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:10,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:10,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:47:10,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:10,206 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:47:10,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2537 states, but on-demand construction may add more states [2025-02-17 22:47:10,287 INFO L131 ngComponentsAnalysis]: Automaton has 615 accepting balls. 2358 [2025-02-17 22:47:10,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:10,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:10,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:47:10,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:10,293 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:47:10,293 INFO L754 eck$LassoCheckResult]: Loop: "[85] L29-->L31: Formula: (< v_x4_1 v_w_1) InVars {x4=v_x4_1, w=v_w_1} OutVars{x4=v_x4_1, w=v_w_1} AuxVars[] AssignedVars[]" "[87] L31-->L29: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:47:10,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 3549, now seen corresponding path program 1 times [2025-02-17 22:47:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857402711] [2025-02-17 22:47:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-02-17 22:47:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524422634] [2025-02-17 22:47:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:10,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:10,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 3413311, now seen corresponding path program 1 times [2025-02-17 22:47:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440475600] [2025-02-17 22:47:10,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:10,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:47:10,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:47:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:47:10,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:47:10,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:10,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:10,460 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:10,461 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:10,461 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:10,461 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:10,461 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:47:10,461 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,461 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:10,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:10,461 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:47:10,462 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:10,462 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:10,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:10,511 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:10,512 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:47:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:10,518 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-02-17 22:47:10,520 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-02-17 22:47:10,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:47:10,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:10,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:10,548 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-02-17 22:47:10,550 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-02-17 22:47:10,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:47:10,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:10,627 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:47:10,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:10,631 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:10,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:10,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:10,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:10,632 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:47:10,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:10,632 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:10,632 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:47:10,632 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:10,632 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:10,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:10,661 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:10,663 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:47:10,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:10,666 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-02-17 22:47:10,668 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-02-17 22:47:10,669 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-02-17 22:47:10,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:47:10,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:47:10,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:47:10,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:47:10,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:47:10,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:47:10,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:47:10,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:47:10,697 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:47:10,698 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:47:10,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:10,703 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-02-17 22:47:10,704 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-02-17 22:47:10,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:47:10,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:47:10,706 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:47:10,706 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-02-17 22:47:10,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:10,714 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:47:10,751 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-02-17 22:47:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:10,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:10,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:47:10,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:10,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:10,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:10,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:10,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:47:10,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:10,869 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-02-17 22:47:10,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2537 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:11,143 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2537 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7074 states and 37685 transitions. Complement of second has 6 states. [2025-02-17 22:47:11,146 INFO L141 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-02-17 22:47:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-02-17 22:47:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:47:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:47:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:47:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:11,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7074 states and 37685 transitions. [2025-02-17 22:47:11,332 INFO L131 ngComponentsAnalysis]: Automaton has 698 accepting balls. 2248 [2025-02-17 22:47:11,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7074 states to 5254 states and 28229 transitions. [2025-02-17 22:47:11,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2394 [2025-02-17 22:47:11,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3824 [2025-02-17 22:47:11,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5254 states and 28229 transitions. [2025-02-17 22:47:11,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:47:11,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5254 states and 28229 transitions. [2025-02-17 22:47:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states and 28229 transitions. [2025-02-17 22:47:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3826. [2025-02-17 22:47:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3826 states have (on average 5.530841610036592) internal successors, (21161), 3825 states have internal predecessors, (21161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 21161 transitions. [2025-02-17 22:47:11,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3826 states and 21161 transitions. [2025-02-17 22:47:11,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 3826 states and 21161 transitions. [2025-02-17 22:47:11,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:47:11,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3826 states and 21161 transitions. [2025-02-17 22:47:11,851 INFO L131 ngComponentsAnalysis]: Automaton has 698 accepting balls. 2248 [2025-02-17 22:47:11,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:11,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:11,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:47:11,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:11,852 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" [2025-02-17 22:47:11,852 INFO L754 eck$LassoCheckResult]: Loop: "[89] L38-->L40: Formula: (< v_x2_1 v_w_3) InVars {x2=v_x2_1, w=v_w_3} OutVars{x2=v_x2_1, w=v_w_3} AuxVars[] AssignedVars[]" "[91] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:47:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 110130, now seen corresponding path program 1 times [2025-02-17 22:47:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437539547] [2025-02-17 22:47:11,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:11,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:47:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:47:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:11,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:47:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:47:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:11,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-02-17 22:47:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248832259] [2025-02-17 22:47:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:11,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:11,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 105837780, now seen corresponding path program 1 times [2025-02-17 22:47:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758402970] [2025-02-17 22:47:11,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:11,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:47:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:47:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:11,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:47:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:47:11,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:11,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:11,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:11,920 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:11,920 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:11,920 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:11,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:11,920 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:47:11,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:11,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:11,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:11,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:47:11,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:11,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:11,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:11,944 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:11,944 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:47:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:11,947 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-02-17 22:47:11,949 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-02-17 22:47:11,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:47:11,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:11,968 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-02-17 22:47:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:11,970 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-02-17 22:47:11,971 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-02-17 22:47:11,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:47:11,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:12,044 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:47:12,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:12,049 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:12,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:12,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:12,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:12,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:47:12,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:12,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:12,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:12,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:47:12,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:12,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:12,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:12,071 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:12,072 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:47:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:12,074 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-02-17 22:47:12,075 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-02-17 22:47:12,077 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-02-17 22:47:12,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:47:12,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:47:12,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:47:12,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:47:12,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:47:12,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:47:12,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:47:12,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:47:12,094 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:47:12,094 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:47:12,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:12,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:12,097 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-02-17 22:47:12,099 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-02-17 22:47:12,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:47:12,100 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:47:12,100 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:47:12,100 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, w) = -1*x2 + 1*w Supporting invariants [] [2025-02-17 22:47:12,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:47:12,106 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:47:12,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:47:12,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:47:12,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:12,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:12,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:47:12,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:12,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:12,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:12,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:47:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:12,158 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-02-17 22:47:12,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3826 states and 21161 transitions. cyclomatic complexity: 18202 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:12,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3826 states and 21161 transitions. cyclomatic complexity: 18202. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11784 states and 67893 transitions. Complement of second has 6 states. [2025-02-17 22:47:12,433 INFO L141 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-02-17 22:47:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-17 22:47:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:47:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:47:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:47:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:12,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11784 states and 67893 transitions. [2025-02-17 22:47:12,497 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-02-17 22:47:12,713 INFO L131 ngComponentsAnalysis]: Automaton has 750 accepting balls. 1996 [2025-02-17 22:47:12,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11784 states to 8566 states and 49533 transitions. [2025-02-17 22:47:12,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3068 [2025-02-17 22:47:12,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4687 [2025-02-17 22:47:12,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8566 states and 49533 transitions. [2025-02-17 22:47:12,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:47:12,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8566 states and 49533 transitions. [2025-02-17 22:47:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8566 states and 49533 transitions. [2025-02-17 22:47:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8566 to 6947. [2025-02-17 22:47:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6947 states, 6947 states have (on average 6.024039153591478) internal successors, (41849), 6946 states have internal predecessors, (41849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6947 states to 6947 states and 41849 transitions. [2025-02-17 22:47:13,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6947 states and 41849 transitions. [2025-02-17 22:47:13,321 INFO L432 stractBuchiCegarLoop]: Abstraction has 6947 states and 41849 transitions. [2025-02-17 22:47:13,321 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:47:13,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6947 states and 41849 transitions. [2025-02-17 22:47:13,379 INFO L131 ngComponentsAnalysis]: Automaton has 750 accepting balls. 1996 [2025-02-17 22:47:13,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:13,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:13,380 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:47:13,380 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:13,381 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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-02-17 22:47:13,381 INFO L754 eck$LassoCheckResult]: Loop: "[93] L47-->L49: Formula: (< v_x3_1 v_w_5) InVars {w=v_w_5, x3=v_x3_1} OutVars{w=v_w_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[95] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:47:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash 3414144, now seen corresponding path program 1 times [2025-02-17 22:47:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630473953] [2025-02-17 22:47:13,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:13,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:47:13,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:47:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:13,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:47:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:47:13,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-02-17 22:47:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:13,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815455869] [2025-02-17 22:47:13,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:13,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:13,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:13,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:13,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:13,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:13,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1013971934, now seen corresponding path program 1 times [2025-02-17 22:47:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716573050] [2025-02-17 22:47:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:13,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:47:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:47:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:13,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:47:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:47:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:13,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:13,427 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:13,427 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:13,427 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:13,427 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:13,427 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:47:13,427 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,427 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:13,427 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:13,427 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:47:13,427 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:13,427 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:13,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:13,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:13,443 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:47:13,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:13,446 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-02-17 22:47:13,447 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-02-17 22:47:13,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:47:13,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:13,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:47:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:13,468 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-02-17 22:47:13,469 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-02-17 22:47:13,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:47:13,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:13,537 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:47:13,541 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-02-17 22:47:13,542 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:13,542 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:13,542 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:13,542 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:13,542 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:47:13,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:13,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:13,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:47:13,542 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:13,542 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:13,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:13,563 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:13,563 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:47:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:13,565 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-02-17 22:47:13,567 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-02-17 22:47:13,569 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-02-17 22:47:13,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:47:13,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:47:13,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:47:13,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:47:13,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:47:13,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:47:13,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:47:13,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:47:13,587 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:47:13,587 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:47:13,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:13,589 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-02-17 22:47:13,591 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-02-17 22:47:13,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:47:13,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:47:13,592 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:47:13,593 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, w) = -1*x3 + 1*w Supporting invariants [] [2025-02-17 22:47:13,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:13,599 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:47:13,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:13,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:47:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:47:13,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:13,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:47:13,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:13,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:13,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:13,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:47:13,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:13,643 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-02-17 22:47:13,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6947 states and 41849 transitions. cyclomatic complexity: 36157 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:13,748 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-02-17 22:47:14,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6947 states and 41849 transitions. cyclomatic complexity: 36157. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21993 states and 135563 transitions. Complement of second has 6 states. [2025-02-17 22:47:14,154 INFO L141 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-02-17 22:47:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-02-17 22:47:14,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:47:14,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:14,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:47:14,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:14,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:47:14,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:14,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21993 states and 135563 transitions. [2025-02-17 22:47:14,468 INFO L131 ngComponentsAnalysis]: Automaton has 660 accepting balls. 1490 [2025-02-17 22:47:14,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21993 states to 14651 states and 90271 transitions. [2025-02-17 22:47:14,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4195 [2025-02-17 22:47:14,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5679 [2025-02-17 22:47:14,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14651 states and 90271 transitions. [2025-02-17 22:47:14,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:47:14,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14651 states and 90271 transitions. [2025-02-17 22:47:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14651 states and 90271 transitions. [2025-02-17 22:47:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14651 to 12335. [2025-02-17 22:47:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12335 states, 12335 states have (on average 6.3831374138629915) internal successors, (78736), 12334 states have internal predecessors, (78736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12335 states to 12335 states and 78736 transitions. [2025-02-17 22:47:15,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12335 states and 78736 transitions. [2025-02-17 22:47:15,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 12335 states and 78736 transitions. [2025-02-17 22:47:15,310 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:47:15,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12335 states and 78736 transitions. [2025-02-17 22:47:15,400 INFO L131 ngComponentsAnalysis]: Automaton has 660 accepting balls. 1490 [2025-02-17 22:47:15,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:15,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:15,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:47:15,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:15,401 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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]" "[117] L16-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-02-17 22:47:15,401 INFO L754 eck$LassoCheckResult]: Loop: "[97] L56-->L58: 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[]" "[99] L58-->L56: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:47:15,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash 105838581, now seen corresponding path program 1 times [2025-02-17 22:47:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555029218] [2025-02-17 22:47:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:15,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:47:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:47:15,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:15,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:47:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:47:15,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:15,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-02-17 22:47:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908074608] [2025-02-17 22:47:15,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:15,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:15,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:15,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1368335657, now seen corresponding path program 1 times [2025-02-17 22:47:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466771982] [2025-02-17 22:47:15,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:15,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:47:15,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:47:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:15,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:47:15,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:47:15,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:15,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:15,442 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:15,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:15,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:15,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:15,443 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:47:15,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:15,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:15,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:47:15,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:15,443 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:15,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:15,457 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:15,457 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:47:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:15,460 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-02-17 22:47:15,462 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-02-17 22:47:15,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:47:15,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:15,479 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-02-17 22:47:15,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:15,481 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-02-17 22:47:15,482 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-02-17 22:47:15,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:47:15,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:15,550 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:47:15,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:15,555 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:15,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:15,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:15,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:15,555 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:47:15,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:15,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:15,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:47:15,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:15,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:15,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:15,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:15,570 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:47:15,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:15,572 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-02-17 22:47:15,574 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-02-17 22:47:15,575 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-02-17 22:47:15,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:47:15,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:47:15,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:47:15,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:47:15,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:47:15,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:47:15,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:47:15,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:47:15,591 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:47:15,591 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:47:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:15,593 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-02-17 22:47:15,595 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-02-17 22:47:15,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:47:15,596 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:47:15,596 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:47:15,596 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:47:15,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:15,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:47:15,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:15,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:47:15,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:47:15,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:15,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:47:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:15,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:15,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:15,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:15,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:47:15,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:15,639 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-02-17 22:47:15,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12335 states and 78736 transitions. cyclomatic complexity: 68156 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:15,764 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-02-17 22:47:16,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12335 states and 78736 transitions. cyclomatic complexity: 68156. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42923 states and 270419 transitions. Complement of second has 7 states. [2025-02-17 22:47:16,402 INFO L141 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-02-17 22:47:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-17 22:47:16,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:47:16,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:16,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:47:16,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:16,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:47:16,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:16,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42923 states and 270419 transitions. [2025-02-17 22:47:17,202 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-02-17 22:47:17,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42923 states to 27450 states and 174006 transitions. [2025-02-17 22:47:17,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7530 [2025-02-17 22:47:17,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8571 [2025-02-17 22:47:17,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27450 states and 174006 transitions. [2025-02-17 22:47:17,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:47:17,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27450 states and 174006 transitions. [2025-02-17 22:47:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27450 states and 174006 transitions. [2025-02-17 22:47:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27450 to 21871. [2025-02-17 22:47:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21871 states, 21871 states have (on average 6.50829866032646) internal successors, (142343), 21870 states have internal predecessors, (142343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21871 states to 21871 states and 142343 transitions. [2025-02-17 22:47:18,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21871 states and 142343 transitions. [2025-02-17 22:47:18,620 INFO L432 stractBuchiCegarLoop]: Abstraction has 21871 states and 142343 transitions. [2025-02-17 22:47:18,620 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:47:18,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21871 states and 142343 transitions. [2025-02-17 22:47:18,941 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-02-17 22:47:18,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:47:18,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:47:18,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:47:18,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:47:18,942 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L14-1-->L38: 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]" "[114] L15-->L47: 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]" "[117] L16-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[96] L56-->L60: 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[]" "[120] L17-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[101] $Ultimate##0-->L67-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-02-17 22:47:18,943 INFO L754 eck$LassoCheckResult]: Loop: "[103] L67-1-->L69: Formula: (< v_y_2 v_x1_6) InVars {y=v_y_2, x1=v_x1_6} OutVars{y=v_y_2, x1=v_x1_6} AuxVars[] AssignedVars[]" "[105] L69-->L67-1: Formula: (= (+ v_x1_7 1) v_x1_8) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-02-17 22:47:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 531267384, now seen corresponding path program 1 times [2025-02-17 22:47:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742237045] [2025-02-17 22:47:18,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:47:18,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:47:18,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:47:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742237045] [2025-02-17 22:47:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742237045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:47:19,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:47:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-17 22:47:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586291822] [2025-02-17 22:47:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:47:19,006 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:47:19,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-02-17 22:47:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:47:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020104146] [2025-02-17 22:47:19,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:47:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:47:19,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:19,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:19,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:19,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:19,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:47:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:19,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:19,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:19,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:47:19,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:47:19,031 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:19,031 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:19,032 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:19,032 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:19,032 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:47:19,032 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,032 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:19,032 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:19,032 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:47:19,032 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:19,032 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:19,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:19,047 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:19,048 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:47:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:19,050 INFO L229 MonitoredProcess]: Starting monitored process 18 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-02-17 22:47:19,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:47:19,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:47:19,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:19,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:47:19,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:19,071 INFO L229 MonitoredProcess]: Starting monitored process 19 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-02-17 22:47:19,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:47:19,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:47:19,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:47:19,147 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:47:19,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:19,152 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:47:19,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:47:19,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:47:19,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:47:19,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:47:19,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:47:19,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:47:19,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:47:19,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:47:19,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:47:19,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:47:19,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:47:19,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:47:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:19,173 INFO L229 MonitoredProcess]: Starting monitored process 20 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-02-17 22:47:19,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:47:19,179 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-02-17 22:47:19,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:47:19,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:47:19,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:47:19,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:47:19,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:47:19,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:47:19,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:47:19,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:47:19,196 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:47:19,196 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:47:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:47:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:47:19,197 INFO L229 MonitoredProcess]: Starting monitored process 21 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-02-17 22:47:19,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:47:19,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:47:19,199 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:47:19,199 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:47:19,199 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-02-17 22:47:19,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:19,205 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:47:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:47:19,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:47:19,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:47:19,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:19,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:47:19,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:19,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:47:19,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:47:19,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:47:19,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:47:19,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:47:19,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:47:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:47:19,245 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-02-17 22:47:19,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21871 states and 142343 transitions. cyclomatic complexity: 123309 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:19,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-17 22:47:20,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21871 states and 142343 transitions. cyclomatic complexity: 123309. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59212 states and 369905 transitions. Complement of second has 7 states. [2025-02-17 22:47:20,172 INFO L141 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-02-17 22:47:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-02-17 22:47:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:47:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:47:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:47:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:47:20,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59212 states and 369905 transitions. [2025-02-17 22:47:21,417 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1192 [2025-02-17 22:47:21,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59212 states to 36445 states and 224803 transitions. [2025-02-17 22:47:21,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9441 [2025-02-17 22:47:21,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10035 [2025-02-17 22:47:21,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36445 states and 224803 transitions. [2025-02-17 22:47:21,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:47:21,977 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36445 states and 224803 transitions. [2025-02-17 22:47:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36445 states and 224803 transitions. [2025-02-17 22:47:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36445 to 24963. [2025-02-17 22:47:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24963 states, 24963 states have (on average 6.487561591154909) internal successors, (161949), 24962 states have internal predecessors, (161949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24963 states to 24963 states and 161949 transitions. [2025-02-17 22:47:23,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24963 states and 161949 transitions. [2025-02-17 22:47:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:47:23,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:47:23,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:47:23,049 INFO L87 Difference]: Start difference. First operand 24963 states and 161949 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:47:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:47:23,342 INFO L93 Difference]: Finished difference Result 5973 states and 34307 transitions. [2025-02-17 22:47:23,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5973 states and 34307 transitions. [2025-02-17 22:47:23,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:47:23,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5973 states to 0 states and 0 transitions. [2025-02-17 22:47:23,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:47:23,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:47:23,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:47:23,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:47:23,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:47:23,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:47:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:47:23,403 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:47:23,403 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:47:23,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:47:23,403 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:47:23,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:47:23,408 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:47:23 BoogieIcfgContainer [2025-02-17 22:47:23,408 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:47:23,409 INFO L158 Benchmark]: Toolchain (without parser) took 13945.08ms. Allocated memory was 159.4MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 86.0MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 934.6MB. Max. memory is 8.0GB. [2025-02-17 22:47:23,410 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:47:23,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.66ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:47:23,410 INFO L158 Benchmark]: Boogie Preprocessor took 16.23ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 629.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:47:23,410 INFO L158 Benchmark]: RCFGBuilder took 179.25ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.7MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:47:23,410 INFO L158 Benchmark]: BuchiAutomizer took 13724.88ms. Allocated memory was 159.4MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 74.6MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 922.1MB. Max. memory is 8.0GB. [2025-02-17 22:47:23,411 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.19ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.66ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.23ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.9MB in the end (delta: 629.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 179.25ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.7MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 13724.88ms. Allocated memory was 159.4MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 74.6MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 922.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + w 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 -1 * x3 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 3.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 22424 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 4.5s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 209 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 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: 41ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:47:23,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...