/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/b5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:19,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:19,936 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:45:19,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:19,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:19,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:19,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:19,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:19,953 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:19,953 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:19,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:19,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:19,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:19,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:19,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:19,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:19,956 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:19,956 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:20,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:20,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:20,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:20,187 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:20,187 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:20,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b5.c.bpl [2025-02-17 22:45:20,188 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b5.c.bpl' [2025-02-17 22:45:20,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:20,201 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:20,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:20,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:20,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,219 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:20,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:20,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:20,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:20,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:20,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:20,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,259 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:45:20,262 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:45:20,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:20,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:20,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:20,284 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:45:20,317 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:20,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:20,364 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:20,364 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:20,371 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:20,371 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:20,372 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:20 BoogieIcfgContainer [2025-02-17 22:45:20,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:20,372 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:20,372 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:20,376 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:20,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,377 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/2) ... [2025-02-17 22:45:20,377 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8cf676 and model type b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:20, skipping insertion in model container [2025-02-17 22:45:20,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,379 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:20" (2/2) ... [2025-02-17 22:45:20,380 INFO L363 chiAutomizerObserver]: Analyzing ICFG b5.c.bpl [2025-02-17 22:45:20,433 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:20,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-02-17 22:45:20,479 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-02-17 22:45:20,480 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-02-17 22:45:20,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-02-17 22:45:20,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-02-17 22:45:20,497 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:20,497 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:20,497 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:20,497 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:20,497 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:20,497 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:20,497 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:20,497 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:20,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:20,523 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-02-17 22:45:20,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:20,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:20,526 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:20,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 41 states, but on-demand construction may add more states [2025-02-17 22:45:20,528 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-02-17 22:45:20,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:20,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:20,532 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:20,532 INFO L754 eck$LassoCheckResult]: Loop: "[39] L21-->L23: Formula: (< (+ v_x5_1 v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[41] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[42] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[43] L25-->L26: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[44] L26-->L21: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 82, now seen corresponding path program 1 times [2025-02-17 22:45:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572140590] [2025-02-17 22:45:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:20,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:20,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 65909640, now seen corresponding path program 1 times [2025-02-17 22:45:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468143098] [2025-02-17 22:45:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:20,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:20,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:20,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1910096425, now seen corresponding path program 1 times [2025-02-17 22:45:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594302114] [2025-02-17 22:45:20,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:20,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:20,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:20,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:20,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,708 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:20,709 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:20,709 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:20,709 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:20,709 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:20,709 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,709 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:20,709 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:20,710 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:20,710 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:20,710 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:20,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:20,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:20,795 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:20,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,799 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:45:20,801 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:45:20,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:20,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:20,824 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:45:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,827 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:45:20,828 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:45:20,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:20,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:20,991 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:20,996 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:45:20,997 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:20,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:20,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:20,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:20,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:20,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:20,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:20,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:20,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:20,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:20,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,053 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,055 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,058 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:45:21,059 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:45:21,061 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:45:21,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:21,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:21,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:21,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:21,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:21,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:21,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:21,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:21,087 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:21,088 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:21,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,091 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:45:21,111 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:45:21,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:21,114 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:21,115 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:21,115 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, x1, z, x5, x4) = -1*x3 - 1*x1 + 1*z - 1*x5 - 1*x4 Supporting invariants [] [2025-02-17 22:45:21,121 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:45:21,125 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:21,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:21,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,256 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:45:21,291 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-02-17 22:45:21,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 41 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 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:45:21,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:21,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 41 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 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 98 states and 201 transitions. Complement of second has 6 states. [2025-02-17 22:45:21,410 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:45:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 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:45:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-02-17 22:45:21,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 5 letters. [2025-02-17 22:45:21,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-17 22:45:21,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 10 letters. [2025-02-17 22:45:21,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 201 transitions. [2025-02-17 22:45:21,429 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-02-17 22:45:21,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 48 states and 101 transitions. [2025-02-17 22:45:21,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-17 22:45:21,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-02-17 22:45:21,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 101 transitions. [2025-02-17 22:45:21,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:21,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 101 transitions. [2025-02-17 22:45:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 101 transitions. [2025-02-17 22:45:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-02-17 22:45:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:45:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 87 transitions. [2025-02-17 22:45:21,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 87 transitions. [2025-02-17 22:45:21,458 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 87 transitions. [2025-02-17 22:45:21,458 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:21,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 87 transitions. [2025-02-17 22:45:21,461 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-02-17 22:45:21,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:21,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:21,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:21,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:21,462 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L12-->L33: 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:45:21,462 INFO L754 eck$LassoCheckResult]: Loop: "[46] L33-->L35: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[48] L35-->L33: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:45:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2596, now seen corresponding path program 1 times [2025-02-17 22:45:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965017349] [2025-02-17 22:45:21,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2025-02-17 22:45:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557653087] [2025-02-17 22:45:21,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2496230, now seen corresponding path program 1 times [2025-02-17 22:45:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965880108] [2025-02-17 22:45:21,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:21,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:21,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,512 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,512 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,512 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,513 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:21,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,513 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,513 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:21,513 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,513 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,531 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,533 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:45:21,535 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:45:21,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,557 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:45:21,558 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:45:21,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:21,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,621 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:21,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:21,625 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,625 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:21,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:21,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,626 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,644 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,644 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,647 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:45:21,648 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:45:21,648 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:45:21,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:21,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:21,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:21,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:21,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:21,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:21,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:21,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:21,666 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:21,666 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:21,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,670 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:45:21,671 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:45:21,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:21,672 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:21,672 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:21,672 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:45:21,677 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:45:21,678 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,711 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:45:21,711 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:45:21,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 87 transitions. cyclomatic complexity: 56 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:45:21,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 87 transitions. cyclomatic complexity: 56. 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 103 states and 226 transitions. Complement of second has 6 states. [2025-02-17 22:45:21,736 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:45:21,736 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:45:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-02-17 22:45:21,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:21,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:21,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:21,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 226 transitions. [2025-02-17 22:45:21,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:21,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:21,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:21,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:21,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:21,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:21,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:21,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:21,744 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:21 BoogieIcfgContainer [2025-02-17 22:45:21,744 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:21,744 INFO L158 Benchmark]: Toolchain (without parser) took 1544.05ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.5MB in the beginning and 87.1MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,746 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.75ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,747 INFO L158 Benchmark]: Boogie Preprocessor took 12.71ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.6MB in the end (delta: 541.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:21,747 INFO L158 Benchmark]: RCFGBuilder took 138.15ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 74.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:21,747 INFO L158 Benchmark]: BuchiAutomizer took 1371.64ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.9MB in the beginning and 87.1MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,748 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.16ms. Allocated memory is still 159.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.75ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.71ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.6MB in the end (delta: 541.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 138.15ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 74.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1371.64ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.9MB in the beginning and 87.1MB in the end (delta: -13.2MB). There was no memory consumed. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + -1 * x5 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 23 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 58ms VariablesStem: 0 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:21,757 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:45:21,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...