/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:07,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:07,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:22:07,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:07,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:07,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:07,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:07,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:07,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:07,801 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:07,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:07,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:07,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:07,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:07,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:07,803 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:07,803 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:08,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:08,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:08,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:08,072 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:08,073 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:08,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl [2025-04-26 16:22:08,076 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl' [2025-04-26 16:22:08,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:08,093 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:08,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:08,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:08,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:08,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,128 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:08,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:08,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:08,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:08,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:08,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:08,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:08,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:08,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:08,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/1) ... [2025-04-26 16:22:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:08,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:22:08,209 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:08,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:08,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:08,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:08,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:08,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:08,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:08,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:08,211 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:22:08,253 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:08,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:08,342 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:08,342 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:08,392 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:08,392 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:08,393 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:08 BoogieIcfgContainer [2025-04-26 16:22:08,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:08,393 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:08,393 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:08,400 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:08,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:08,400 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:08" (1/2) ... [2025-04-26 16:22:08,402 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b83b488 and model type array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:08, skipping insertion in model container [2025-04-26 16:22:08,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:08,402 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:08" (2/2) ... [2025-04-26 16:22:08,403 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-int-trans.wvr.bpl [2025-04-26 16:22:08,448 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:08,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:08,498 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:22:08,500 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:08,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:22:08,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:08,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:08,506 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:08,517 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:08,518 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:08,519 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:08,519 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:08,519 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:08,519 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:08,519 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:08,519 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:08,520 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:08,567 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:08,568 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:08,568 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:08,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:08,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:08,572 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:08,572 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:08,577 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:08,578 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:08,578 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:08,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:08,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:08,582 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 16:22:08,583 INFO L754 eck$LassoCheckResult]: Loop: "[88] L34-->L34: Formula: (let ((.cse1 (select v_array_2_9 v_i_6_16)) (.cse2 (select v_array_0_9 v_i_6_16))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not v_break_7_13) .cse0) (and (not .cse0) v_break_7_13)) (not v_break_7_14) (< v_i_6_17 v_len_1_11) (= v_result_8_17 (ite .cse0 v_result_8_18 (+ (* (- 1) .cse1) .cse2))) (< v_i_6_17 v_len_3_11) (= v_i_6_16 (+ v_i_6_17 1))))) InVars {result_8=v_result_8_18, i_6=v_i_6_17, len_1=v_len_1_11, array_2=v_array_2_9, len_3=v_len_3_11, break_7=v_break_7_14, array_0=v_array_0_9} OutVars{result_8=v_result_8_17, i_6=v_i_6_16, len_1=v_len_1_11, array_2=v_array_2_9, break_7=v_break_7_13, len_3=v_len_3_11, array_0=v_array_0_9} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 16:22:08,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash 4147, now seen corresponding path program 1 times [2025-04-26 16:22:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375969930] [2025-04-26 16:22:08,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:08,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:08,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 16:22:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781240600] [2025-04-26 16:22:08,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:08,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:08,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:08,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:08,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 128645, now seen corresponding path program 1 times [2025-04-26 16:22:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244782476] [2025-04-26 16:22:08,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:08,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:08,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,879 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:08,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:08,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:08,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:08,880 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:08,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:08,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:08,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:08,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:08,881 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:08,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,173 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:09,176 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:22:09,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:09,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,208 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:09,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,256 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:09,256 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:09,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:09,364 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:22:09,365 INFO L437 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:09,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:09,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:22:09,371 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:09,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:22:09,392 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:22:09,392 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:09,393 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_6, len_1) = -1*i_6 + 1*len_1 Supporting invariants [] [2025-04-26 16:22:09,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:09,402 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:09,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:09,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:09,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:09,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:09,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:09,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:09,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:09,506 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:09,509 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:09,593 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 275 states and 936 transitions. Complement of second has 5 states. [2025-04-26 16:22:09,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:22:09,605 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:09,605 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,605 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:09,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,606 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:09,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 936 transitions. [2025-04-26 16:22:09,618 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:09,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 163 states and 563 transitions. [2025-04-26 16:22:09,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 16:22:09,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2025-04-26 16:22:09,632 INFO L74 IsDeterministic]: Start isDeterministic. Operand 163 states and 563 transitions. [2025-04-26 16:22:09,632 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:09,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 563 transitions. [2025-04-26 16:22:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 563 transitions. [2025-04-26 16:22:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2025-04-26 16:22:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 3.5606060606060606) internal successors, (in total 470), 131 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 470 transitions. [2025-04-26 16:22:09,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:09,659 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:09,659 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:09,659 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 470 transitions. [2025-04-26 16:22:09,661 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:09,661 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:09,661 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:09,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:09,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:09,662 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[90] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= (+ v_result_11_19 v_len_5_11) v_len_3_17) (= v_i_9_18 0)) InVars {len_5=v_len_5_11, len_3=v_len_3_17} OutVars{len_5=v_len_5_11, result_11=v_result_11_19, break_10=v_break_10_15, len_3=v_len_3_17, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 16:22:09,662 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L53: Formula: (let ((.cse2 (select v_array_2_15 v_i_9_14)) (.cse1 (select v_array_4_9 v_i_9_14))) (let ((.cse0 (= .cse2 .cse1))) (and (< v_i_9_15 v_len_3_13) (< v_i_9_15 v_len_5_7) (not v_break_10_10) (= (+ v_i_9_15 1) v_i_9_14) (or (and v_break_10_9 (not .cse0)) (and .cse0 (not v_break_10_9))) (= (ite .cse0 v_result_11_14 (+ (* (- 1) .cse1) .cse2)) v_result_11_13)))) InVars {result_11=v_result_11_14, break_10=v_break_10_10, array_4=v_array_4_9, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_7, i_9=v_i_9_15} OutVars{result_11=v_result_11_13, break_10=v_break_10_9, array_4=v_array_4_9, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_7, i_9=v_i_9_14} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 16:22:09,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 129174, now seen corresponding path program 1 times [2025-04-26 16:22:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888470678] [2025-04-26 16:22:09,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:09,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:09,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:09,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:09,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 1 times [2025-04-26 16:22:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307125108] [2025-04-26 16:22:09,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:09,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:09,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:09,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:09,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 4004486, now seen corresponding path program 1 times [2025-04-26 16:22:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:09,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232637412] [2025-04-26 16:22:09,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:09,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:09,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:09,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:09,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:09,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:09,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:09,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,834 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:09,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:09,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:09,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:09,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:09,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:09,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:09,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:09,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:09,835 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:09,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,065 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:10,066 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:10,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:22:10,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:10,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:10,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:22:10,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:10,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,109 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:10,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,132 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:10,132 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:10,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:10,204 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:22:10,204 INFO L437 ModelExtractionUtils]: 47 out of 57 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:10,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:22:10,207 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:10,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:22:10,227 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:22:10,227 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:10,227 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_9) = 1*len_5 - 1*i_9 Supporting invariants [] [2025-04-26 16:22:10,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:10,235 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:10,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:10,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:10,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:10,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:10,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:10,274 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:10,274 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:10,313 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 363 states and 1358 transitions. Complement of second has 4 states. [2025-04-26 16:22:10,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-26 16:22:10,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:10,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:10,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:10,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 1358 transitions. [2025-04-26 16:22:10,320 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:10,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 195 states and 733 transitions. [2025-04-26 16:22:10,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-04-26 16:22:10,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-04-26 16:22:10,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 195 states and 733 transitions. [2025-04-26 16:22:10,324 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:10,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 733 transitions. [2025-04-26 16:22:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 733 transitions. [2025-04-26 16:22:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2025-04-26 16:22:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 3.8089171974522293) internal successors, (in total 598), 156 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 598 transitions. [2025-04-26 16:22:10,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:10,334 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:10,334 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:10,334 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 598 transitions. [2025-04-26 16:22:10,335 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:10,335 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:10,335 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:10,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:10,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:10,338 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[106] L86-->$Ultimate##0: 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]" "[94] $Ultimate##0-->L72: Formula: (and (= v_len_1_17 (+ v_result_14_19 v_len_5_17)) (= v_i_12_18 0) (not v_break_13_15)) InVars {len_1=v_len_1_17, len_5=v_len_5_17} OutVars{len_5=v_len_5_17, i_12=v_i_12_18, result_14=v_result_14_19, len_1=v_len_1_17, break_13=v_break_13_15} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:22:10,339 INFO L754 eck$LassoCheckResult]: Loop: "[96] L72-->L72: Formula: (let ((.cse1 (select v_array_4_15 v_i_12_14)) (.cse2 (select v_array_0_15 v_i_12_14))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_12_15 v_len_5_13) (or (and v_break_13_9 (not .cse0)) (and .cse0 (not v_break_13_9))) (< v_i_12_15 v_len_1_13) (not v_break_13_10) (= (+ v_i_12_15 1) v_i_12_14) (= v_result_14_13 (ite .cse0 v_result_14_14 (+ (* (- 1) .cse1) .cse2)))))) InVars {result_14=v_result_14_14, array_4=v_array_4_15, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_13, i_12=v_i_12_15, break_13=v_break_13_10} OutVars{result_14=v_result_14_13, array_4=v_array_4_15, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_13, i_12=v_i_12_14, break_13=v_break_13_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:22:10,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 4004984, now seen corresponding path program 1 times [2025-04-26 16:22:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636327910] [2025-04-26 16:22:10,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:10,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2025-04-26 16:22:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351651800] [2025-04-26 16:22:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:10,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 124154600, now seen corresponding path program 1 times [2025-04-26 16:22:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:10,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564703145] [2025-04-26 16:22:10,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:10,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:10,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:10,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:10,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:10,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:10,507 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:10,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:10,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:10,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:10,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:10,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:10,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:10,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:10,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:10,508 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:10,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:10,751 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:10,751 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:10,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:22:10,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:10,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,786 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:10,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,802 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:10,803 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:10,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:10,865 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:22:10,865 INFO L437 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:10,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:22:10,868 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:10,889 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-04-26 16:22:10,889 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:22:10,889 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:10,890 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_12, len_5) = -1*i_12 + 1*len_5 Supporting invariants [] [2025-04-26 16:22:10,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:22:10,898 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:10,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:10,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:10,933 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:10,933 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:10,975 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 329 states and 1186 transitions. Complement of second has 4 states. [2025-04-26 16:22:10,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:22:10,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:10,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:10,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:10,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1186 transitions. [2025-04-26 16:22:10,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:10,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:10,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:10,982 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:10,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:10,982 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:10,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:10,982 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:10,989 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:10 BoogieIcfgContainer [2025-04-26 16:22:10,989 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:10,990 INFO L158 Benchmark]: Toolchain (without parser) took 2896.53ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 82.2MB in the beginning and 48.6MB in the end (delta: 33.6MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:10,990 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:10,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.55ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:10,990 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:10,990 INFO L158 Benchmark]: RCFGBuilder took 229.21ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 66.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:10,991 INFO L158 Benchmark]: BuchiAutomizer took 2595.70ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 66.5MB in the beginning and 48.6MB in the end (delta: 17.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2025-04-26 16:22:10,992 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.84ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.55ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 229.21ms. Allocated memory is still 155.2MB. Free memory was 79.1MB in the beginning and 66.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2595.70ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 66.5MB in the beginning and 48.6MB in the end (delta: 17.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 69 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 25 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax100 hnf100 lsp101 ukn63 mio100 lsp100 div100 bol108 ite100 ukn100 eq166 hnf97 smp100 dnf247 smp55 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 215ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len_1 + -1 * i_6 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + len_5 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_12 + len_5 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:11,006 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...