/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:21:01,709 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:21:01,768 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:21:01,790 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:21:01,791 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:21:01,791 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:21:01,792 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:21:01,793 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:21:01,793 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:21:01,796 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:21:01,796 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:21:01,796 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:21:01,796 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:21:01,797 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:21:01,798 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:21:01,798 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:21:01,798 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:21:01,798 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:21:01,799 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:21:01,799 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:21:01,799 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:21:01,800 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:21:01,800 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:21:01,801 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:21:01,802 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:21:01,802 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:21:01,802 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:21:01,803 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:21:01,804 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:21:01,804 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:21:01,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:21:02,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:21:02,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:21:02,019 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:21:02,020 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:21:02,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl [2023-10-12 17:21:02,021 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum-print2.bpl' [2023-10-12 17:21:02,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:21:02,052 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:21:02,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:02,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:21:02,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:21:02,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,087 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:21:02,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:02,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:21:02,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:21:02,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:21:02,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:21:02,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:21:02,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:21:02,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:21:02,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/1) ... [2023-10-12 17:21:02,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:02,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:02,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:02,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:21:02,201 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T4 given in one single declaration [2023-10-12 17:21:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure T4 [2023-10-12 17:21:02,204 INFO L138 BoogieDeclarations]: Found implementation of procedure T4 [2023-10-12 17:21:02,204 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:21:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:21:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:21:02,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2023-10-12 17:21:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2023-10-12 17:21:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2023-10-12 17:21:02,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T3 given in one single declaration [2023-10-12 17:21:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure T3 [2023-10-12 17:21:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure T3 [2023-10-12 17:21:02,207 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:21:02,248 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:21:02,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:21:02,333 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:21:02,348 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:21:02,348 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:21:02,349 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T2EXIT is neither atomic block end nor error location. [2023-10-12 17:21:02,349 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: T3EXIT is neither atomic block end nor error location. [2023-10-12 17:21:02,350 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:02 BoogieIcfgContainer [2023-10-12 17:21:02,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:21:02,351 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:21:02,351 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:21:02,354 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:21:02,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:02,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:02" (1/2) ... [2023-10-12 17:21:02,356 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c5bea1 and model type sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:21:02, skipping insertion in model container [2023-10-12 17:21:02,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:02,356 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:02" (2/2) ... [2023-10-12 17:21:02,357 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-print2.bpl [2023-10-12 17:21:02,400 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:21:02,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:21:02,434 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:21:02,435 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:21:02,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:21:02,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:21:02,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:21:02,443 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:21:02,453 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:21:02,455 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:21:02,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:21:02,460 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:21:02,461 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:21:02,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:21:02,462 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:21:02,694 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:21:02,694 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:21:02,703 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:21:02,703 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:21:02,703 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:21:02,703 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:21:02,704 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:21:02,704 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:21:02,704 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:21:02,704 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:21:02,704 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 16 transitions, 50 flow [2023-10-12 17:21:02,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:02,707 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:21:02,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:02,707 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:02,709 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:21:02,710 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 16 transitions, 50 flow [2023-10-12 17:21:02,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:02,711 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:21:02,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:02,711 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:02,715 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x] 41#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 43#[L25, L76-1]true [2023-10-12 17:21:02,715 INFO L750 eck$LassoCheckResult]: Loop: 43#[L25, L76-1]true [85] L25-->L25: Formula: (and (= (+ v_x_17 (select v_A_9 v_i_21)) v_x_16) (= v_i_20 (+ v_i_21 1)) (< v_i_21 v_N_9)) InVars {A=v_A_9, i=v_i_21, x=v_x_17, N=v_N_9} OutVars{A=v_A_9, i=v_i_20, x=v_x_16, N=v_N_9} AuxVars[] AssignedVars[i, x] 43#[L25, L76-1]true [2023-10-12 17:21:02,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 4399, now seen corresponding path program 1 times [2023-10-12 17:21:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348289350] [2023-10-12 17:21:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:02,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2023-10-12 17:21:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946243804] [2023-10-12 17:21:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:02,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 136454, now seen corresponding path program 1 times [2023-10-12 17:21:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31519327] [2023-10-12 17:21:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:02,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:02,912 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:02,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:02,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:02,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:02,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:02,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:02,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:02,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:02,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:21:02,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:02,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:02,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:02,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:02,943 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:02,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:02,993 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:02,996 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:03,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:21:03,002 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 [2023-10-12 17:21:03,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:03,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:03,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:03,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:03,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:03,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:03,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:03,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:03,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:03,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:21:03,046 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 [2023-10-12 17:21:03,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:03,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:03,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:03,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:03,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:03,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:03,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:03,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:21:03,077 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:21:03,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:03,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:03,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:21:03,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:03,160 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:21:03,160 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:03,161 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:21:03,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:21:03,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:21:03,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:03,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:03,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:03,219 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:21:03,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:03,245 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 [2023-10-12 17:21:03,246 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-10-12 17:21:03,343 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 5 states and 256 transitions. [2023-10-12 17:21:03,344 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:03,348 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-10-12 17:21:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-10-12 17:21:03,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:21:03,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:03,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:21:03,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:03,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:21:03,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 180 transitions, 936 flow [2023-10-12 17:21:03,412 INFO L124 PetriNetUnfolderBase]: 188/291 cut-off events. [2023-10-12 17:21:03,412 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-10-12 17:21:03,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 291 events. 188/291 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 872 event pairs, 25 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 450. Up to 98 conditions per place. [2023-10-12 17:21:03,414 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 180 transitions, 936 flow [2023-10-12 17:21:03,419 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 180 transitions, 936 flow [2023-10-12 17:21:03,420 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 180 transitions, 936 flow [2023-10-12 17:21:03,421 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:21:03,422 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 180 transitions, 936 flow [2023-10-12 17:21:03,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:03,441 INFO L124 PetriNetUnfolderBase]: 63/99 cut-off events. [2023-10-12 17:21:03,441 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-10-12 17:21:03,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:03,446 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L76: Formula: (and (= v_x_28 0) (= v_y_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, y=v_y_24, x=v_x_28} AuxVars[] AssignedVars[i, y, x] 41#[L76]true [90] L76-->L25: Formula: (and (= v_T2Thread1of1ForFork0_thidvar0_2 2) (= v_T2Thread1of1ForFork0_thidvar1_2 2)) InVars {} OutVars{T2Thread1of1ForFork0_thidvar1=v_T2Thread1of1ForFork0_thidvar1_2, T2Thread1of1ForFork0_thidvar0=v_T2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[T2Thread1of1ForFork0_thidvar1, T2Thread1of1ForFork0_thidvar0] 43#[L25, L76-1]true [93] L76-1-->L38: Formula: (and (= v_T3Thread1of1ForFork1_thidvar1_2 3) (= v_T3Thread1of1ForFork1_thidvar2_2 3) (= v_T3Thread1of1ForFork1_thidvar0_2 3)) InVars {} OutVars{T3Thread1of1ForFork1_thidvar1=v_T3Thread1of1ForFork1_thidvar1_2, T3Thread1of1ForFork1_thidvar2=v_T3Thread1of1ForFork1_thidvar2_2, T3Thread1of1ForFork1_thidvar0=v_T3Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[T3Thread1of1ForFork1_thidvar1, T3Thread1of1ForFork1_thidvar2, T3Thread1of1ForFork1_thidvar0] 88#[L25, L38, L77]true [87] L38-->L38: Formula: (and (= v_i_24 (+ v_i_25 1)) (< v_i_25 v_N_11) (= v_x_20 (+ v_x_21 (select v_A_11 v_i_25)))) InVars {A=v_A_11, i=v_i_25, x=v_x_21, N=v_N_11} OutVars{A=v_A_11, i=v_i_24, x=v_x_20, N=v_N_11} AuxVars[] AssignedVars[i, x] 88#[L25, L38, L77]true [96] L77-->$Ultimate##0: Formula: (and (= v_T4Thread1of1ForFork2_thidvar1_2 4) (= v_T4Thread1of1ForFork2_thidvar2_2 4) (= v_T4Thread1of1ForFork2_thidvar3_2 4) (= v_T4Thread1of1ForFork2_thidvar0_2 4)) InVars {} OutVars{T4Thread1of1ForFork2_thidvar2=v_T4Thread1of1ForFork2_thidvar2_2, T4Thread1of1ForFork2_thidvar1=v_T4Thread1of1ForFork2_thidvar1_2, T4Thread1of1ForFork2_thidvar3=v_T4Thread1of1ForFork2_thidvar3_2, T4Thread1of1ForFork2_thidvar0=v_T4Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[T4Thread1of1ForFork2_thidvar2, T4Thread1of1ForFork2_thidvar1, T4Thread1of1ForFork2_thidvar3, T4Thread1of1ForFork2_thidvar0] 91#[$Ultimate##0, L78, L25, L38]true [74] $Ultimate##0-->L54-2: Formula: (= v_k_1 0) InVars {} OutVars{k=v_k_1} AuxVars[] AssignedVars[k] 93#[L54-2, L78, L25, L38]true [111] L54-2-->L54-2: Formula: (let ((.cse0 (select v_A_In_1 v_k_In_1)) (.cse1 (+ v_k_In_1 1))) (or (and (= (+ .cse0 v_y_In_1) v_y_Out_2) (<= v_N_In_1 v_k_Out_2) (< v_k_In_1 v_N_In_1) (= v_k_Out_2 .cse1)) (and (= v_k_Out_2 (+ 2 v_k_In_1)) (= v_y_Out_2 (+ .cse0 (select v_A_In_1 .cse1) v_y_In_1)) (< .cse1 v_N_In_1)))) InVars {A=v_A_In_1, y=v_y_In_1, N=v_N_In_1, k=v_k_In_1} OutVars{A=v_A_In_1, y=v_y_Out_2, N=v_N_In_1, k=v_k_Out_2} AuxVars[] AssignedVars[k, y] 93#[L54-2, L78, L25, L38]true [2023-10-12 17:21:03,446 INFO L750 eck$LassoCheckResult]: Loop: 93#[L54-2, L78, L25, L38]true [111] L54-2-->L54-2: Formula: (let ((.cse0 (select v_A_In_1 v_k_In_1)) (.cse1 (+ v_k_In_1 1))) (or (and (= (+ .cse0 v_y_In_1) v_y_Out_2) (<= v_N_In_1 v_k_Out_2) (< v_k_In_1 v_N_In_1) (= v_k_Out_2 .cse1)) (and (= v_k_Out_2 (+ 2 v_k_In_1)) (= v_y_Out_2 (+ .cse0 (select v_A_In_1 .cse1) v_y_In_1)) (< .cse1 v_N_In_1)))) InVars {A=v_A_In_1, y=v_y_In_1, N=v_N_In_1, k=v_k_In_1} OutVars{A=v_A_In_1, y=v_y_Out_2, N=v_N_In_1, k=v_k_Out_2} AuxVars[] AssignedVars[k, y] 93#[L54-2, L78, L25, L38]true [111] L54-2-->L54-2: Formula: (let ((.cse0 (select v_A_In_1 v_k_In_1)) (.cse1 (+ v_k_In_1 1))) (or (and (= (+ .cse0 v_y_In_1) v_y_Out_2) (<= v_N_In_1 v_k_Out_2) (< v_k_In_1 v_N_In_1) (= v_k_Out_2 .cse1)) (and (= v_k_Out_2 (+ 2 v_k_In_1)) (= v_y_Out_2 (+ .cse0 (select v_A_In_1 .cse1) v_y_In_1)) (< .cse1 v_N_In_1)))) InVars {A=v_A_In_1, y=v_y_In_1, N=v_N_In_1, k=v_k_In_1} OutVars{A=v_A_In_1, y=v_y_Out_2, N=v_N_In_1, k=v_k_Out_2} AuxVars[] AssignedVars[k, y] 93#[L54-2, L78, L25, L38]true [2023-10-12 17:21:03,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1474157596, now seen corresponding path program 1 times [2023-10-12 17:21:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088345521] [2023-10-12 17:21:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:03,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:03,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 4513, now seen corresponding path program 1 times [2023-10-12 17:21:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464898829] [2023-10-12 17:21:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:03,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -673754372, now seen corresponding path program 2 times [2023-10-12 17:21:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388693271] [2023-10-12 17:21:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:03,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:03,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:21:03,882 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:03,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:03,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:03,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:03,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:03,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:03,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:03,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:03,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-print2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:21:03,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:03,883 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:03,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,058 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,060 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,062 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,064 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:04,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:04,272 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:04,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:04,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:21:04,294 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 [2023-10-12 17:21:04,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:04,302 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:21:04,302 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:21:04,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:04,317 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-10-12 17:21:04,317 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:21:04,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:04,385 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-10-12 17:21:04,385 INFO L444 ModelExtractionUtils]: 36 out of 56 variables were initially zero. Simplification set additionally 17 variables to zero. [2023-10-12 17:21:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:04,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:21:04,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:04,422 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:21:04,423 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:04,423 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:21:04,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:21:04,439 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:21:04,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:04,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:04,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:04,477 WARN L260 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:21:04,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:04,532 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 [2023-10-12 17:21:04,532 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-10-12 17:21:04,587 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 5 states and 252 transitions. [2023-10-12 17:21:04,588 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:04,596 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-10-12 17:21:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2023-10-12 17:21:04,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:21:04,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:04,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:21:04,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:04,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 130 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:21:04,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:04,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 2064 transitions, 14976 flow [2023-10-12 17:21:04,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:04,706 INFO L124 PetriNetUnfolderBase]: 479/743 cut-off events. [2023-10-12 17:21:04,706 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-10-12 17:21:04,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 743 events. 479/743 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2918 event pairs, 31 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1551. Up to 270 conditions per place. [2023-10-12 17:21:04,709 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 43 places, 2064 transitions, 14976 flow [2023-10-12 17:21:04,728 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 43 places, 2064 transitions, 14976 flow [2023-10-12 17:21:04,728 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 2064 transitions, 14976 flow [2023-10-12 17:21:04,728 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:21:04,728 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 2064 transitions, 14976 flow [2023-10-12 17:21:04,829 INFO L124 PetriNetUnfolderBase]: 479/743 cut-off events. [2023-10-12 17:21:04,829 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-10-12 17:21:04,829 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:21:04,835 INFO L201 PluginConnector]: Adding new model sum-print2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:21:04 BoogieIcfgContainer [2023-10-12 17:21:04,835 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:21:04,839 INFO L158 Benchmark]: Toolchain (without parser) took 2784.05ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 131.5MB in the beginning and 144.4MB in the end (delta: -12.9MB). Peak memory consumption was 75.1MB. Max. memory is 8.0GB. [2023-10-12 17:21:04,840 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 184.5MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:21:04,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 184.5MB. Free memory was 131.5MB in the beginning and 151.8MB in the end (delta: -20.4MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2023-10-12 17:21:04,841 INFO L158 Benchmark]: Boogie Preprocessor took 17.55ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 150.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:21:04,842 INFO L158 Benchmark]: RCFGBuilder took 243.13ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 150.6MB in the beginning and 199.5MB in the end (delta: -48.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-10-12 17:21:04,842 INFO L158 Benchmark]: BuchiAutomizer took 2484.43ms. Allocated memory is still 235.9MB. Free memory was 199.5MB in the beginning and 144.4MB in the end (delta: 55.1MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. [2023-10-12 17:21:04,847 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.25ms. Allocated memory is still 184.5MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 184.5MB. Free memory was 131.5MB in the beginning and 151.8MB in the end (delta: -20.4MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.55ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 150.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.13ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 150.6MB in the beginning and 199.5MB in the end (delta: -48.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 2484.43ms. Allocated memory is still 235.9MB. Free memory was 199.5MB in the beginning and 144.4MB in the end (delta: 55.1MB). Peak memory consumption was 90.7MB. 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 N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 80 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp158 ukn61 mio100 lsp78 div100 bol100 ite100 ukn100 eq177 hnf97 smp100 dnf143 smp67 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 150ms VariablesStem: 6 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 16 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 12 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:21:04,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...