/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/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:19,796 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:19,998 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:30:20,015 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:20,016 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:20,016 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:20,017 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:20,017 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:20,018 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:20,018 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:20,018 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:20,018 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:20,019 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:20,019 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:20,019 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:20,019 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:20,020 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:20,020 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:20,020 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:20,020 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:20,021 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:20,024 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:20,024 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:20,024 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:20,024 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:20,025 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:20,025 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:20,025 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:20,025 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:20,026 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:20,026 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:20,026 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:20,027 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:20,027 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:20,028 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:30:20,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:20,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:20,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:20,260 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:20,261 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:20,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl [2023-10-12 17:30:20,264 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-array.wvr.bpl' [2023-10-12 17:30:20,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:20,291 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:20,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:20,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:20,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:20,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,313 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:20,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:20,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:20,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:20,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:20,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:20,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:20,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:20,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:20,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/1) ... [2023-10-12 17:30:20,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:20,387 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:30:20,431 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:30:20,458 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:20,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:20,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:20,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:20,462 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:20,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:20,462 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:30:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:30:20,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:30:20,463 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:30:20,509 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:20,511 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:20,621 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:20,634 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:20,634 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:20,636 INFO L201 PluginConnector]: Adding new model sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:20 BoogieIcfgContainer [2023-10-12 17:30:20,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:20,636 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:20,637 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:20,641 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:20,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:20,642 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:20" (1/2) ... [2023-10-12 17:30:20,643 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27e90de0 and model type sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:20, skipping insertion in model container [2023-10-12 17:30:20,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:20,643 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:20" (2/2) ... [2023-10-12 17:30:20,644 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-array.wvr.bpl [2023-10-12 17:30:20,699 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:30:20,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:30:20,732 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:30:20,732 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:20,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:30:20,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:30:20,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:30:20,741 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:20,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:30:20,753 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:30:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:30:20,760 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:30:20,760 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:20,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:30:20,761 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:30:20,964 INFO L134 LiptonReduction]: Checked pairs total: 106 [2023-10-12 17:30:20,965 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:30:20,976 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:20,976 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:20,976 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:20,976 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:20,976 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:20,976 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:20,976 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:20,977 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:20,977 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:20,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:20,980 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:20,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:20,981 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:20,983 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:20,983 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:20,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:20,984 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:20,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:20,984 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:20,987 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_i_19 v_sum1_19) (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_sum2_29) (= v_i_19 v_j_19)) InVars {sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [2023-10-12 17:30:20,987 INFO L750 eck$LassoCheckResult]: Loop: 44#[L22-1, L58-1]true [99] L22-1-->L22-1: Formula: (and (= (+ (select v_A_14 v_i_16) v_sum1_16) v_sum1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {sum1=v_sum1_16, A=v_A_14, N=v_N_12, i=v_i_16} OutVars{sum1=v_sum1_15, A=v_A_14, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[sum1, i] 44#[L22-1, L58-1]true [2023-10-12 17:30:20,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:30:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485860441] [2023-10-12 17:30:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:30:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932902415] [2023-10-12 17:30:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 130423, now seen corresponding path program 1 times [2023-10-12 17:30:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:21,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761843266] [2023-10-12 17:30:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,242 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:21,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:21,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:21,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:21,243 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:21,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,243 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:21,243 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:21,243 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:21,243 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:21,243 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:21,253 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:30:21,283 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:30:21,286 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:30:21,288 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:30:21,351 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:21,354 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:21,358 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:30:21,371 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:30:21,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:21,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:21,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:21,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:21,385 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:30:21,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:21,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:21,408 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:21,416 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:30:21,417 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:30:21,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:21,422 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:30:21,423 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:30:21,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:21,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:21,447 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:21,447 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:30:21,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:30:21,455 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:30:21,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:21,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:21,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:21,489 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:21,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:21,489 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:30:21,509 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:30:21,510 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:30:21,578 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:30:21,579 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:21,581 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:21,586 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:30:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:30:21,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:30:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:30:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:21,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:21,610 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:30:21,610 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:30:21,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 554 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:30:21,611 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:21,614 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:21,614 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:21,615 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:21,615 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:21,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:21,621 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:30:21,621 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:30:21,621 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:21,621 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_i_19 v_sum1_19) (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_sum2_29) (= v_i_19 v_j_19)) InVars {sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: 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] 89#[L22-1, L59, L33-1]true [2023-10-12 17:30:21,622 INFO L750 eck$LassoCheckResult]: Loop: 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_12 v_j_16) v_sum2_26) v_sum2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, sum2=v_sum2_26, M=v_M_10, j=v_j_16} OutVars{A=v_A_12, sum2=v_sum2_25, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j] 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_12 v_j_16) v_sum2_26) v_sum2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, sum2=v_sum2_26, M=v_M_10, j=v_j_16} OutVars{A=v_A_12, sum2=v_sum2_25, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j] 89#[L22-1, L59, L33-1]true [2023-10-12 17:30:21,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:30:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430524104] [2023-10-12 17:30:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 1 times [2023-10-12 17:30:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487205743] [2023-10-12 17:30:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash 125325192, now seen corresponding path program 1 times [2023-10-12 17:30:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:21,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688340260] [2023-10-12 17:30:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:21,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:21,769 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:21,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:21,769 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:21,769 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:21,769 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:21,769 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:21,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:21,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:30:21,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:21,770 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:21,772 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:30:21,774 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:30:21,776 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:30:21,778 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:30:21,795 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:30:21,798 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:30:21,866 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:21,867 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:21,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:21,869 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:30:21,882 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:30:21,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:21,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:21,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:21,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:21,893 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:30:21,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:21,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:21,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:21,918 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:30:21,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:21,935 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:30:21,938 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:30:21,940 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:30:21,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:21,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:21,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:21,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:21,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:21,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:21,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:21,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:21,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:22,009 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:30:22,022 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:30:22,023 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:30:22,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:22,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:22,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:22,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:22,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:22,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:22,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:22,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:30:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:22,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:22,054 INFO L229 MonitoredProcess]: Starting monitored process 7 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:30:22,073 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:30:22,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:22,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:22,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:22,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:22,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:30:22,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:22,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:22,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:22,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:30:22,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:22,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:22,112 INFO L229 MonitoredProcess]: Starting monitored process 8 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:30:22,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:30:22,123 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:30:22,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:22,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:22,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:22,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:22,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:22,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:22,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:22,148 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:30:22,159 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:30:22,160 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:30:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:22,161 INFO L229 MonitoredProcess]: Starting monitored process 9 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:30:22,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:30:22,165 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:22,191 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:22,192 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:22,192 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:30:22,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:22,210 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:22,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:22,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:22,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:22,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:22,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:22,243 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:30:22,244 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:30:22,244 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:22,335 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 338 transitions. [2023-10-12 17:30:22,335 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:22,349 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:30:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:30:22,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:30:22,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:22,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:30:22,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:22,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:22,416 INFO L124 PetriNetUnfolderBase]: 383/568 cut-off events. [2023-10-12 17:30:22,416 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-10-12 17:30:22,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 568 events. 383/568 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2007 event pairs, 26 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1278. Up to 202 conditions per place. [2023-10-12 17:30:22,420 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:22,447 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:22,447 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:22,447 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:22,447 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:22,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:22,483 INFO L124 PetriNetUnfolderBase]: 151/213 cut-off events. [2023-10-12 17:30:22,483 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-10-12 17:30:22,484 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:22,484 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_i_19 v_sum1_19) (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_sum2_29) (= v_i_19 v_j_19)) InVars {sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: 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] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= (+ (select v_A_14 v_i_16) v_sum1_16) v_sum1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {sum1=v_sum1_16, A=v_A_14, N=v_N_12, i=v_i_16} OutVars{sum1=v_sum1_15, A=v_A_14, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[sum1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: 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] 148#[L22-1, L60, L33-1, L44-1]true [98] L22-1-->thread1EXIT: Formula: (<= v_N_10 v_i_13) InVars {N=v_N_10, i=v_i_13} OutVars{N=v_N_10, i=v_i_13} AuxVars[] AssignedVars[] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= (+ (select v_A_10 v_k_16) v_sum2_22) v_sum2_21) (= v_k_15 (+ v_k_16 1)) (< v_k_16 v_N_8)) InVars {A=v_A_10, sum2=v_sum2_22, N=v_N_8, k=v_k_16} OutVars{A=v_A_10, sum2=v_sum2_21, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[sum2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:30:22,484 INFO L750 eck$LassoCheckResult]: Loop: 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= (+ (select v_A_10 v_k_16) v_sum2_22) v_sum2_21) (= v_k_15 (+ v_k_16 1)) (< v_k_16 v_N_8)) InVars {A=v_A_10, sum2=v_sum2_22, N=v_N_8, k=v_k_16} OutVars{A=v_A_10, sum2=v_sum2_21, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[sum2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= (+ (select v_A_10 v_k_16) v_sum2_22) v_sum2_21) (= v_k_15 (+ v_k_16 1)) (< v_k_16 v_N_8)) InVars {A=v_A_10, sum2=v_sum2_22, N=v_N_8, k=v_k_16} OutVars{A=v_A_10, sum2=v_sum2_21, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[sum2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:30:22,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 178478329, now seen corresponding path program 1 times [2023-10-12 17:30:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489195846] [2023-10-12 17:30:22,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:22,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:22,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:22,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 1 times [2023-10-12 17:30:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201913494] [2023-10-12 17:30:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:22,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:22,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:22,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -281014631, now seen corresponding path program 2 times [2023-10-12 17:30:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671446291] [2023-10-12 17:30:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671446291] [2023-10-12 17:30:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671446291] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474531497] [2023-10-12 17:30:22,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:22,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:22,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:30:22,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:30:22,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:22,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:22,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:30:22,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:22,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:22,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474531497] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:22,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:22,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-10-12 17:30:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367609649] [2023-10-12 17:30:22,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-10-12 17:30:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-10-12 17:30:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 2608 transitions, 19104 flow. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:30:22,855 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:23,435 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:30:23,435 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:30:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14703 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:30:23,451 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 645 selfloop transitions, 271 changer transitions 384/1300 dead transitions. [2023-10-12 17:30:23,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,652 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:30:23,652 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:30:23,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14689 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:30:23,655 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,665 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-10-12 17:30:23,666 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,666 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:23,666 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:30:23,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:23,698 INFO L124 PetriNetUnfolderBase]: 260/390 cut-off events. [2023-10-12 17:30:23,698 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-10-12 17:30:23,698 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:23,698 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_i_19 v_sum1_19) (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_sum2_29) (= v_i_19 v_j_19)) InVars {sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{sum1=v_sum1_19, sum2=v_sum2_29, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: 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] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= (+ (select v_A_14 v_i_16) v_sum1_16) v_sum1_15) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_12)) InVars {sum1=v_sum1_16, A=v_A_14, N=v_N_12, i=v_i_16} OutVars{sum1=v_sum1_15, A=v_A_14, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[sum1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: 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] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:30:23,698 INFO L750 eck$LassoCheckResult]: Loop: 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= (+ (select v_A_10 v_k_16) v_sum2_22) v_sum2_21) (= v_k_15 (+ v_k_16 1)) (< v_k_16 v_N_8)) InVars {A=v_A_10, sum2=v_sum2_22, N=v_N_8, k=v_k_16} OutVars{A=v_A_10, sum2=v_sum2_21, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[sum2, k] 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= (+ (select v_A_10 v_k_16) v_sum2_22) v_sum2_21) (= v_k_15 (+ v_k_16 1)) (< v_k_16 v_N_8)) InVars {A=v_A_10, sum2=v_sum2_22, N=v_N_8, k=v_k_16} OutVars{A=v_A_10, sum2=v_sum2_21, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[sum2, k] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:30:23,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash 125325244, now seen corresponding path program 1 times [2023-10-12 17:30:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110835537] [2023-10-12 17:30:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:23,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 2 times [2023-10-12 17:30:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575206183] [2023-10-12 17:30:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:23,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash 178478236, now seen corresponding path program 1 times [2023-10-12 17:30:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928341830] [2023-10-12 17:30:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:23,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:23,884 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:23,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:23,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:23,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:23,885 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:23,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:23,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:23,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:23,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-array.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:30:23,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:23,885 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:23,886 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:30:23,888 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:30:23,891 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:30:23,893 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:30:23,895 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:30:23,897 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:30:23,899 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:30:23,901 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:30:23,934 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:30:24,036 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:24,036 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:24,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,054 INFO L229 MonitoredProcess]: Starting monitored process 11 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:30:24,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:30:24,079 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:30:24,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:30:24,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,137 INFO L229 MonitoredProcess]: Starting monitored process 12 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:30:24,155 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:30:24,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:30:24,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,201 INFO L229 MonitoredProcess]: Starting monitored process 13 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:30:24,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:30:24,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:30:24,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,249 INFO L229 MonitoredProcess]: Starting monitored process 14 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:30:24,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:30:24,259 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:30:24,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,282 INFO L229 MonitoredProcess]: Starting monitored process 15 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:30:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:30:24,286 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:30:24,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,315 INFO L229 MonitoredProcess]: Starting monitored process 16 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:30:24,329 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:30:24,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:30:24,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,355 INFO L229 MonitoredProcess]: Starting monitored process 17 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:30:24,392 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:30:24,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:30:24,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:24,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,428 INFO L229 MonitoredProcess]: Starting monitored process 18 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:30:24,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:30:24,453 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:30:24,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:24,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:24,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:24,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:24,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:24,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:24,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:24,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:30:24,490 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:24,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:24,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:24,493 INFO L229 MonitoredProcess]: Starting monitored process 19 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:30:24,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:30:24,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:24,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:24,522 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:24,522 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:30:24,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:24,530 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:24,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:24,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:24,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:24,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:24,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:24,563 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:30:24,564 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:30:24,564 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:24,675 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 338 transitions. [2023-10-12 17:30:24,676 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:24,762 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:30:24,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:30:24,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:24,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:30:24,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:24,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:30:24,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:24,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:30:25,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:30,456 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:30:30,457 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:30:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 6244 events. 4062/6244 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 37270 event pairs, 4 based on Foata normal form. 0/3699 useless extension candidates. Maximal degree in co-relation 23231. Up to 2296 conditions per place. [2023-10-12 17:30:30,463 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:30:30,654 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:30:30,654 INFO L430 stractBuchiCegarLoop]: Abstraction has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:30:30,654 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:30:30,654 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:30:36,594 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:30:36,594 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:30:36,594 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:30:36,598 INFO L201 PluginConnector]: Adding new model sum-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:36 BoogieIcfgContainer [2023-10-12 17:30:36,598 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:36,599 INFO L158 Benchmark]: Toolchain (without parser) took 16307.55ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 155.9MB in the beginning and 626.2MB in the end (delta: -470.3MB). Peak memory consumption was 854.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:36,599 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.21ms. Allocated memory is still 207.6MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:36,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.27ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:36,599 INFO L158 Benchmark]: Boogie Preprocessor took 16.42ms. Allocated memory is still 207.6MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:36,599 INFO L158 Benchmark]: RCFGBuilder took 303.02ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 153.2MB in the beginning and 216.6MB in the end (delta: -63.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:36,600 INFO L158 Benchmark]: BuchiAutomizer took 15961.66ms. Allocated memory was 249.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 216.1MB in the beginning and 626.2MB in the end (delta: -410.1MB). Peak memory consumption was 872.3MB. Max. memory is 8.0GB. [2023-10-12 17:30:36,601 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 1.21ms. Allocated memory is still 207.6MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.27ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.42ms. Allocated memory is still 207.6MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 303.02ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 153.2MB in the beginning and 216.6MB in the end (delta: -63.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 15961.66ms. Allocated memory was 249.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 216.1MB in the beginning and 626.2MB in the end (delta: -410.1MB). Peak memory consumption was 872.3MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 146 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp70 ukn86 mio100 lsp68 div100 bol100 ite100 ukn100 eq156 hnf92 smp100 dnf100 smp100 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 92ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 0, independent unconditional: 106, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 106, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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:30:36,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:36,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...