/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/ie2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:57,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:58,030 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:48:58,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:58,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:58,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:58,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:58,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:58,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:58,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:58,051 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:58,051 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:58,051 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:58,051 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:58,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:58,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:58,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:58,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:58,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:58,053 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:58,053 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:58,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:58,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:58,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:58,489 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:58,490 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:58,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/ie2.c.bpl [2025-02-17 22:48:58,492 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/ie2.c.bpl' [2025-02-17 22:48:58,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:58,510 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:58,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:58,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:58,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,529 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:58,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:58,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:58,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:58,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:58,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:58,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:58,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:58,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/1) ... [2025-02-17 22:48:58,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,574 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:48:58,576 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:48:58,596 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:58,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:58,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:58,597 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:58,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:58,599 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:48:58,634 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:58,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:58,701 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:58,701 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:58,707 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:58,707 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:58,708 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58 BoogieIcfgContainer [2025-02-17 22:48:58,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:58,709 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:58,709 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:58,712 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:58,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,713 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:58" (1/2) ... [2025-02-17 22:48:58,714 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b31a694 and model type ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:58, skipping insertion in model container [2025-02-17 22:48:58,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:58,714 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:58" (2/2) ... [2025-02-17 22:48:58,715 INFO L363 chiAutomizerObserver]: Analyzing ICFG ie2.c.bpl [2025-02-17 22:48:58,770 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:58,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-02-17 22:48:58,833 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-02-17 22:48:58,834 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:58,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-17 22:48:58,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-02-17 22:48:58,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-02-17 22:48:58,847 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:59,437 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:59,437 INFO L101 AmpleReduction]: Number of pruned transitions: 558, Number of non-trivial ample sets: 740 [2025-02-17 22:48:59,437 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 562 [2025-02-17 22:48:59,445 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:59,445 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:59,445 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:59,445 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:59,445 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:59,445 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:59,446 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:59,446 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:59,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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:48:59,489 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-02-17 22:48:59,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:59,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,495 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:59,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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:48:59,511 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-02-17 22:48:59,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:59,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,515 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:59,515 INFO L754 eck$LassoCheckResult]: Loop: "[92] L26-->L28: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[94] L28-->L26: 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:48:59,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-02-17 22:48:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95868648] [2025-02-17 22:48:59,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-02-17 22:48:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286499284] [2025-02-17 22:48:59,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 3574022, now seen corresponding path program 1 times [2025-02-17 22:48:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402569951] [2025-02-17 22:48:59,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,629 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,630 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,630 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,630 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,630 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,630 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,630 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,631 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,662 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,663 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,666 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:48:59,668 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:48:59,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:59,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,690 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:48:59,691 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:48:59,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,764 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:59,769 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,769 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,769 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,769 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,769 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,769 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,769 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,769 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,769 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,769 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,769 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,810 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,815 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:48:59,817 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:48:59,818 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:48:59,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,844 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:59,844 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:59,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,848 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:48:59,849 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:48:59,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,850 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,850 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,851 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-02-17 22:48:59,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:48:59,859 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,938 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,954 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:48:59,974 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:48:59,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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) 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:49:00,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 635 states, 634 states have (on average 2.4274447949526814) internal successors, (1539), 634 states have internal predecessors, (1539), 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). 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 1575 states and 4128 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,105 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:49:00,108 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:49:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-17 22:49:00,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:00,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1575 states and 4128 transitions. [2025-02-17 22:49:00,135 INFO L131 ngComponentsAnalysis]: Automaton has 148 accepting balls. 394 [2025-02-17 22:49:00,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1575 states to 1051 states and 2846 transitions. [2025-02-17 22:49:00,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 637 [2025-02-17 22:49:00,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816 [2025-02-17 22:49:00,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1051 states and 2846 transitions. [2025-02-17 22:49:00,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1051 states and 2846 transitions. [2025-02-17 22:49:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states and 2846 transitions. [2025-02-17 22:49:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 874. [2025-02-17 22:49:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 874 states have (on average 2.7711670480549198) internal successors, (2422), 873 states have internal predecessors, (2422), 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:49:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 2422 transitions. [2025-02-17 22:49:00,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 874 states and 2422 transitions. [2025-02-17 22:49:00,201 INFO L432 stractBuchiCegarLoop]: Abstraction has 874 states and 2422 transitions. [2025-02-17 22:49:00,201 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:00,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 874 states and 2422 transitions. [2025-02-17 22:49:00,205 INFO L131 ngComponentsAnalysis]: Automaton has 148 accepting balls. 394 [2025-02-17 22:49:00,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:00,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,206 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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:49:00,206 INFO L754 eck$LassoCheckResult]: Loop: "[101] L41-->L43: Formula: (< v_x3_5 v_z2_1) InVars {z2=v_z2_1, x3=v_x3_5} OutVars{z2=v_z2_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[103] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:00,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times [2025-02-17 22:49:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898329585] [2025-02-17 22:49:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-02-17 22:49:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979750324] [2025-02-17 22:49:00,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 110824793, now seen corresponding path program 1 times [2025-02-17 22:49:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941752052] [2025-02-17 22:49:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,237 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,237 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,237 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,237 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,237 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,237 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,237 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,237 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,237 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:00,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,256 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,256 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,258 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:49:00,261 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:49:00,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,282 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:49:00,283 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:49:00,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,347 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:49:00,352 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,353 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:00,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,353 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,369 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,369 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,371 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:49:00,373 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:49:00,374 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:49:00,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,388 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,390 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:49:00,391 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:49:00,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,392 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,392 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,392 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x3) = 1*z2 - 1*x3 Supporting invariants [] [2025-02-17 22:49:00,398 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:49:00,399 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,445 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:49:00,445 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:49:00,446 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 874 states and 2422 transitions. cyclomatic complexity: 1731 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:49:00,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 874 states and 2422 transitions. cyclomatic complexity: 1731. 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 2323 states and 6720 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,515 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:49:00,516 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:49:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-17 22:49:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2323 states and 6720 transitions. [2025-02-17 22:49:00,533 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 352 [2025-02-17 22:49:00,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2323 states to 1516 states and 4451 transitions. [2025-02-17 22:49:00,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2025-02-17 22:49:00,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 929 [2025-02-17 22:49:00,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1516 states and 4451 transitions. [2025-02-17 22:49:00,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1516 states and 4451 transitions. [2025-02-17 22:49:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states and 4451 transitions. [2025-02-17 22:49:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1310. [2025-02-17 22:49:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1310 states have (on average 3.031297709923664) internal successors, (3971), 1309 states have internal predecessors, (3971), 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:49:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 3971 transitions. [2025-02-17 22:49:00,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1310 states and 3971 transitions. [2025-02-17 22:49:00,590 INFO L432 stractBuchiCegarLoop]: Abstraction has 1310 states and 3971 transitions. [2025-02-17 22:49:00,590 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:00,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1310 states and 3971 transitions. [2025-02-17 22:49:00,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,596 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 352 [2025-02-17 22:49:00,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:00,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,597 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[126] L16-->L56: 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:49:00,597 INFO L754 eck$LassoCheckResult]: Loop: "[110] L56-->L58: Formula: (< v_x4_5 v_z3_1) InVars {x4=v_x4_5, z3=v_z3_1} OutVars{x4=v_x4_5, z3=v_z3_1} AuxVars[] AssignedVars[]" "[112] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:00,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash 3575015, now seen corresponding path program 1 times [2025-02-17 22:49:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951939544] [2025-02-17 22:49:00,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-02-17 22:49:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660901634] [2025-02-17 22:49:00,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -859374359, now seen corresponding path program 1 times [2025-02-17 22:49:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522388357] [2025-02-17 22:49:00,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,634 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,635 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,652 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,654 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:49:00,655 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:49:00,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,675 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:49:00,676 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:49:00,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,746 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:49:00,750 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,750 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,750 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,750 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,750 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,750 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,750 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,750 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,750 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,765 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,767 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:49:00,768 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:49:00,770 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:49:00,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,786 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,788 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:49:00,789 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:49:00,790 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,790 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,790 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,790 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x4) = 1*z3 - 1*x4 Supporting invariants [] [2025-02-17 22:49:00,796 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:49:00,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,826 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,839 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:49:00,839 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:49:00,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1310 states and 3971 transitions. cyclomatic complexity: 2901 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:49:00,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1310 states and 3971 transitions. cyclomatic complexity: 2901. 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 3497 states and 10944 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,913 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:49:00,913 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:49:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-02-17 22:49:00,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:00,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:00,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:00,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3497 states and 10944 transitions. [2025-02-17 22:49:00,937 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 296 [2025-02-17 22:49:00,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3497 states to 2096 states and 6573 transitions. [2025-02-17 22:49:00,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 825 [2025-02-17 22:49:00,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 980 [2025-02-17 22:49:00,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2096 states and 6573 transitions. [2025-02-17 22:49:00,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2096 states and 6573 transitions. [2025-02-17 22:49:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states and 6573 transitions. [2025-02-17 22:49:01,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1882. [2025-02-17 22:49:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1882 states have (on average 3.2215727948990436) internal successors, (6063), 1881 states have internal predecessors, (6063), 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:49:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 6063 transitions. [2025-02-17 22:49:01,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1882 states and 6063 transitions. [2025-02-17 22:49:01,025 INFO L432 stractBuchiCegarLoop]: Abstraction has 1882 states and 6063 transitions. [2025-02-17 22:49:01,025 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:01,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1882 states and 6063 transitions. [2025-02-17 22:49:01,032 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 296 [2025-02-17 22:49:01,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:01,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:01,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:01,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:01,032 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:01,032 INFO L754 eck$LassoCheckResult]: Loop: "[97] L32-1-->L34: Formula: (< v_x3_1 v_z1_3) InVars {x3=v_x3_1, z1=v_z1_3} OutVars{x3=v_x3_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[99] L34-->L32-1: 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:49:01,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 110793785, now seen corresponding path program 1 times [2025-02-17 22:49:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:01,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297341438] [2025-02-17 22:49:01,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:01,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:01,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,069 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:49:01,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297341438] [2025-02-17 22:49:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297341438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602347180] [2025-02-17 22:49:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:01,073 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-02-17 22:49:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685782090] [2025-02-17 22:49:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:01,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:01,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:01,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:01,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:01,088 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:01,088 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:01,088 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:01,088 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:01,088 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:01,088 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,088 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:01,088 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:01,088 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:01,088 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:01,088 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:01,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:01,103 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:01,103 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:01,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,105 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:49:01,105 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:49:01,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:01,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:01,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,125 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:49:01,125 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:49:01,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:01,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:01,193 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:01,197 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:49:01,197 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:01,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:01,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:01,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:01,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:01,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:01,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:01,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:01,197 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:01,197 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:01,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:01,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:01,218 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:01,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,221 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:49:01,222 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:49:01,223 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:49:01,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:01,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:01,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:01,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:01,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:01,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:01,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:01,236 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:01,239 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:01,239 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,241 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:49:01,242 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:49:01,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:01,242 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:01,242 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:01,242 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-02-17 22:49:01,248 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:49:01,248 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:01,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:01,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,289 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:49:01,289 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:49:01,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1882 states and 6063 transitions. cyclomatic complexity: 4476 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:49:01,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1882 states and 6063 transitions. cyclomatic complexity: 4476. 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 4304 states and 14709 transitions. Complement of second has 6 states. [2025-02-17 22:49:01,366 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:49:01,367 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:49:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-02-17 22:49:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:01,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4304 states and 14709 transitions. [2025-02-17 22:49:01,414 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:49:01,425 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 209 [2025-02-17 22:49:01,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4304 states to 3096 states and 10547 transitions. [2025-02-17 22:49:01,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 936 [2025-02-17 22:49:01,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1126 [2025-02-17 22:49:01,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3096 states and 10547 transitions. [2025-02-17 22:49:01,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:01,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3096 states and 10547 transitions. [2025-02-17 22:49:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states and 10547 transitions. [2025-02-17 22:49:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 2708. [2025-02-17 22:49:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2708 states have (on average 3.507754800590842) internal successors, (9499), 2707 states have internal predecessors, (9499), 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:49:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 9499 transitions. [2025-02-17 22:49:01,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2708 states and 9499 transitions. [2025-02-17 22:49:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:01,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:01,503 INFO L87 Difference]: Start difference. First operand 2708 states and 9499 transitions. Second operand has 4 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:49:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:01,574 INFO L93 Difference]: Finished difference Result 1486 states and 4669 transitions. [2025-02-17 22:49:01,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 4669 transitions. [2025-02-17 22:49:01,584 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 175 [2025-02-17 22:49:01,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 4669 transitions. [2025-02-17 22:49:01,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 607 [2025-02-17 22:49:01,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 607 [2025-02-17 22:49:01,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 4669 transitions. [2025-02-17 22:49:01,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:01,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1486 states and 4669 transitions. [2025-02-17 22:49:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 4669 transitions. [2025-02-17 22:49:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2025-02-17 22:49:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1486 states have (on average 3.141991924629879) internal successors, (4669), 1485 states have internal predecessors, (4669), 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:49:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 4669 transitions. [2025-02-17 22:49:01,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1486 states and 4669 transitions. [2025-02-17 22:49:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:49:01,658 INFO L432 stractBuchiCegarLoop]: Abstraction has 1486 states and 4669 transitions. [2025-02-17 22:49:01,658 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:01,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 4669 transitions. [2025-02-17 22:49:01,665 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 175 [2025-02-17 22:49:01,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:01,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:01,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:01,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:01,666 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:49:01,666 INFO L754 eck$LassoCheckResult]: Loop: "[106] L47-1-->L49: Formula: (< v_x4_1 v_z2_3) InVars {x4=v_x4_1, z2=v_z2_3} OutVars{x4=v_x4_1, z2=v_z2_3} AuxVars[] AssignedVars[]" "[108] L49-->L47-1: 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:49:01,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1249305235, now seen corresponding path program 1 times [2025-02-17 22:49:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:01,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905632157] [2025-02-17 22:49:01,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:01,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:01,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,715 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:49:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905632157] [2025-02-17 22:49:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905632157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900839117] [2025-02-17 22:49:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:01,716 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:01,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-02-17 22:49:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996476403] [2025-02-17 22:49:01,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:01,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:01,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:01,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:01,737 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:01,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:01,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:01,737 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:01,737 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:01,737 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,737 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:01,737 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:01,737 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:01,737 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:01,737 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:01,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:01,752 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:01,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,754 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:49:01,756 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:49:01,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:01,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:01,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,794 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:49:01,794 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:49:01,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:01,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:01,868 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:01,872 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:49:01,872 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:01,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:01,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:01,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:01,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:01,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:01,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:01,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:01,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:01,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:01,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:01,891 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:01,891 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,894 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:49:01,895 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:49:01,896 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:49:01,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:01,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:01,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:01,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:01,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:01,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:01,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:01,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:01,912 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:01,912 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:01,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:01,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,913 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:49:01,914 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:49:01,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:01,915 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:01,915 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:01,915 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x4) = 1*z2 - 1*x4 Supporting invariants [] [2025-02-17 22:49:01,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:49:01,922 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:01,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,971 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:49:01,971 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:49:01,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1486 states and 4669 transitions. cyclomatic complexity: 3414 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:49:02,034 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1486 states and 4669 transitions. cyclomatic complexity: 3414. 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 3252 states and 10847 transitions. Complement of second has 6 states. [2025-02-17 22:49:02,034 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:49:02,035 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:49:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-02-17 22:49:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:02,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:02,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:02,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3252 states and 10847 transitions. [2025-02-17 22:49:02,061 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 108 [2025-02-17 22:49:02,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3252 states to 2164 states and 7414 transitions. [2025-02-17 22:49:02,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 585 [2025-02-17 22:49:02,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 691 [2025-02-17 22:49:02,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2164 states and 7414 transitions. [2025-02-17 22:49:02,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:02,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2164 states and 7414 transitions. [2025-02-17 22:49:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states and 7414 transitions. [2025-02-17 22:49:02,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1926. [2025-02-17 22:49:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1926 states have (on average 3.4740394600207685) internal successors, (6691), 1925 states have internal predecessors, (6691), 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:49:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 6691 transitions. [2025-02-17 22:49:02,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1926 states and 6691 transitions. [2025-02-17 22:49:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-17 22:49:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-17 22:49:02,146 INFO L87 Difference]: Start difference. First operand 1926 states and 6691 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:49:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:02,179 INFO L93 Difference]: Finished difference Result 484 states and 1443 transitions. [2025-02-17 22:49:02,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 1443 transitions. [2025-02-17 22:49:02,182 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-02-17 22:49:02,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 438 states and 1289 transitions. [2025-02-17 22:49:02,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2025-02-17 22:49:02,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2025-02-17 22:49:02,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 1289 transitions. [2025-02-17 22:49:02,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:02,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 438 states and 1289 transitions. [2025-02-17 22:49:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 1289 transitions. [2025-02-17 22:49:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-02-17 22:49:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 438 states have (on average 2.942922374429224) internal successors, (1289), 437 states have internal predecessors, (1289), 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:49:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1289 transitions. [2025-02-17 22:49:02,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 438 states and 1289 transitions. [2025-02-17 22:49:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-17 22:49:02,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 438 states and 1289 transitions. [2025-02-17 22:49:02,192 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:02,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 438 states and 1289 transitions. [2025-02-17 22:49:02,194 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-02-17 22:49:02,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:02,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:02,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:02,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:02,195 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[126] L16-->L56: 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]" "[109] L56-->L60: Formula: (<= v_z3_2 v_x4_8) InVars {x4=v_x4_8, z3=v_z3_2} OutVars{x4=v_x4_8, z3=v_z3_2} AuxVars[] AssignedVars[]" "[111] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[113] L61-->L62-1: Formula: (<= 3 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" "[97] L32-1-->L34: Formula: (< v_x3_1 v_z1_3) InVars {x3=v_x3_1, z1=v_z1_3} OutVars{x3=v_x3_1, z1=v_z1_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:02,195 INFO L754 eck$LassoCheckResult]: Loop: "[115] L62-1-->L64: Formula: (< v_x1_5 v_z3_3) InVars {x1=v_x1_5, z3=v_z3_3} OutVars{x1=v_x1_5, z3=v_z3_3} AuxVars[] AssignedVars[]" "[117] L64-->L62-1: Formula: (= (+ v_x1_7 1) v_x1_6) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1168128470, now seen corresponding path program 1 times [2025-02-17 22:49:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265369100] [2025-02-17 22:49:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:02,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:02,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:02,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 4643, now seen corresponding path program 1 times [2025-02-17 22:49:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201404056] [2025-02-17 22:49:02,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1584991732, now seen corresponding path program 1 times [2025-02-17 22:49:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216227217] [2025-02-17 22:49:02,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:02,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:02,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:02,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:02,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,257 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:02,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:02,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:02,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:02,257 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:02,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:02,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:02,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:02,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:02,257 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:02,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:02,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:02,276 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,278 INFO L229 MonitoredProcess]: Starting monitored process 22 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:49:02,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:49:02,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:02,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:02,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:02,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,306 INFO L229 MonitoredProcess]: Starting monitored process 23 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:49:02,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:49:02,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:02,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:02,375 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:02,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:02,380 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:02,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:02,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:02,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:02,380 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:02,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:02,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:02,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:02,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:02,381 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:02,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:02,398 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:02,398 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:02,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,400 INFO L229 MonitoredProcess]: Starting monitored process 24 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:49:02,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:49:02,402 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:49:02,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:02,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:02,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:02,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:02,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:02,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:02,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:02,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:02,421 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:02,422 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:02,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,424 INFO L229 MonitoredProcess]: Starting monitored process 25 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:49:02,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:49:02,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:02,427 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:02,427 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:02,427 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x1) = 1*z3 - 1*x1 Supporting invariants [] [2025-02-17 22:49:02,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:49:02,433 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:02,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:02,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:02,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:02,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:02,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:02,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:02,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:02,478 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:49:02,479 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:49:02,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 438 states and 1289 transitions. cyclomatic complexity: 918 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:02,511 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 438 states and 1289 transitions. cyclomatic complexity: 918. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 1047 states and 3155 transitions. Complement of second has 6 states. [2025-02-17 22:49:02,511 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:49:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-17 22:49:02,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:49:02,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 15 letters. Loop has 2 letters. [2025-02-17 22:49:02,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 13 letters. Loop has 4 letters. [2025-02-17 22:49:02,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1047 states and 3155 transitions. [2025-02-17 22:49:02,518 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-02-17 22:49:02,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1047 states to 332 states and 915 transitions. [2025-02-17 22:49:02,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-02-17 22:49:02,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-02-17 22:49:02,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 915 transitions. [2025-02-17 22:49:02,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:02,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 915 transitions. [2025-02-17 22:49:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 915 transitions. [2025-02-17 22:49:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-17 22:49:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.7560240963855422) internal successors, (915), 331 states have internal predecessors, (915), 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:49:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 915 transitions. [2025-02-17 22:49:02,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 915 transitions. [2025-02-17 22:49:02,527 INFO L432 stractBuchiCegarLoop]: Abstraction has 332 states and 915 transitions. [2025-02-17 22:49:02,527 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:49:02,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 915 transitions. [2025-02-17 22:49:02,529 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-02-17 22:49:02,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:02,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:02,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:02,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:02,530 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[126] L16-->L56: 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]" "[109] L56-->L60: Formula: (<= v_z3_2 v_x4_8) InVars {x4=v_x4_8, z3=v_z3_2} OutVars{x4=v_x4_8, z3=v_z3_2} AuxVars[] AssignedVars[]" "[111] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[96] L32-1-->thread1FINAL: Formula: (<= v_z1_4 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_4} OutVars{x3=v_x3_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" "[113] L61-->L62-1: Formula: (<= 3 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-02-17 22:49:02,530 INFO L754 eck$LassoCheckResult]: Loop: "[115] L62-1-->L64: Formula: (< v_x1_5 v_z3_3) InVars {x1=v_x1_5, z3=v_z3_3} OutVars{x1=v_x1_5, z3=v_z3_3} AuxVars[] AssignedVars[]" "[117] L64-->L62-1: Formula: (= (+ v_x1_7 1) v_x1_6) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1852260209, now seen corresponding path program 1 times [2025-02-17 22:49:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717919400] [2025-02-17 22:49:02,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:02,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:02,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:02,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:02,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 4643, now seen corresponding path program 2 times [2025-02-17 22:49:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590954128] [2025-02-17 22:49:02,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1905596623, now seen corresponding path program 1 times [2025-02-17 22:49:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209257342] [2025-02-17 22:49:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-17 22:49:02,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-17 22:49:02,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:02,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-17 22:49:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-17 22:49:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:02,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:02,570 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:02,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:02,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:02,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:02,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:02,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:02,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:02,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:02,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:02,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:02,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:02,584 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:02,584 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,587 INFO L229 MonitoredProcess]: Starting monitored process 26 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:49:02,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:49:02,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:02,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:02,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,608 INFO L229 MonitoredProcess]: Starting monitored process 27 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:49:02,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:49:02,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:02,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:02,677 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:02,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:02,682 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:02,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:02,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:02,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:02,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:02,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:02,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:02,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:02,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:02,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:02,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:02,697 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:02,697 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:02,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,699 INFO L229 MonitoredProcess]: Starting monitored process 28 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:49:02,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:49:02,701 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:49:02,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:02,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:02,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:02,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:02,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:02,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:02,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:02,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:02,716 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:02,716 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:02,718 INFO L229 MonitoredProcess]: Starting monitored process 29 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:49:02,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:49:02,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:02,721 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:02,721 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:02,721 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x1) = 1*z3 - 1*x1 Supporting invariants [] [2025-02-17 22:49:02,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:02,727 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:02,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:02,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:02,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:02,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:02,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:02,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:02,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:02,766 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:02,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:02,776 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:49:02,776 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:49:02,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 915 transitions. cyclomatic complexity: 633 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:02,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 915 transitions. cyclomatic complexity: 633. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 496 states and 1408 transitions. Complement of second has 6 states. [2025-02-17 22:49:02,799 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:49:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-02-17 22:49:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-17 22:49:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-17 22:49:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 14 letters. Loop has 4 letters. [2025-02-17 22:49:02,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:02,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 496 states and 1408 transitions. [2025-02-17 22:49:02,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:02,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 496 states to 0 states and 0 transitions. [2025-02-17 22:49:02,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:02,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:02,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:02,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:02,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:02,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:02,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:02,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:49:02,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:02,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:02,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:02,808 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:02 BoogieIcfgContainer [2025-02-17 22:49:02,808 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:02,809 INFO L158 Benchmark]: Toolchain (without parser) took 4299.30ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 87.2MB in the beginning and 54.8MB in the end (delta: 32.4MB). Peak memory consumption was 85.8MB. Max. memory is 8.0GB. [2025-02-17 22:49:02,809 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:02,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.53ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 85.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:02,809 INFO L158 Benchmark]: Boogie Preprocessor took 10.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 85.0MB in the end (delta: 787.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:02,809 INFO L158 Benchmark]: RCFGBuilder took 165.45ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 75.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:02,810 INFO L158 Benchmark]: BuchiAutomizer took 4099.64ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 75.6MB in the beginning and 54.8MB in the end (delta: 20.9MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:02,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.53ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 85.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 85.0MB in the end (delta: 787.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.45ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 75.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4099.64ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 75.6MB in the beginning and 54.8MB in the end (delta: 20.9MB). Peak memory consumption was 77.4MB. 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 9 terminating modules (2 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1223 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 739 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 368 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 640, Trivial Ample Sets caused by loops: 562, Number of non-trivial ample sets: 740, Number of pruned transitions: 558, Number of transitions in reduction automaton: 1539, Number of states in reduction automaton: 635, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:02,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:49:03,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:49:03,222 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...