/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_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:34,204 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:34,275 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:14:34,306 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:34,306 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:34,307 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:34,308 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:34,309 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:34,309 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:34,311 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:34,311 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:34,311 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:34,311 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:34,312 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:34,312 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:34,312 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:34,313 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:34,313 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:34,313 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:34,313 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:34,314 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:34,314 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:34,314 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:34,314 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:34,315 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:34,315 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:34,315 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:34,315 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:34,316 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:34,316 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:34,316 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:34,316 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:34,317 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:34,317 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:34,318 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_AUTOMATON [2023-10-12 17:14:34,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:34,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:34,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:34,548 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:34,548 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:34,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2023-10-12 17:14:34,550 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2023-10-12 17:14:34,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:34,580 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:34,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:34,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:34,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:34,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,608 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:34,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:34,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:34,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:34,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:34,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:34,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:34,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:34,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:34,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/1) ... [2023-10-12 17:14:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,664 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:14:34,677 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:14:34,711 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:34,712 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:34,712 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:34,713 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:34,714 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:14:34,764 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:34,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:34,889 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:34,909 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:34,909 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:34,911 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:34 BoogieIcfgContainer [2023-10-12 17:14:34,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:34,912 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:34,912 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:34,916 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:34,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:34,917 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:34" (1/2) ... [2023-10-12 17:14:34,919 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79a177cd and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:34, skipping insertion in model container [2023-10-12 17:14:34,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:34,919 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:34" (2/2) ... [2023-10-12 17:14:34,920 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2023-10-12 17:14:34,970 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:35,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:14:35,069 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:14:35,069 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:14:35,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:14:35,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:14:35,080 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:35,092 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:14:35,094 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:14:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:14:35,102 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:14:35,102 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:35,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:14:35,103 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:14:35,326 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:14:35,326 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:14:35,343 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:35,343 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:35,343 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:35,344 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:35,344 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:35,344 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:35,344 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:35,344 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:35,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:35,375 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:35,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,380 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:35,380 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,380 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:35,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 31 states, but on-demand construction may add more states [2023-10-12 17:14:35,384 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 22 [2023-10-12 17:14:35,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,384 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:35,384 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,389 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]don't care [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]don't care [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]don't care [2023-10-12 17:14:35,389 INFO L750 eck$LassoCheckResult]: Loop: 43#[L23-1, L61-1]don't care [107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum] 43#[L23-1, L61-1]don't care [2023-10-12 17:14:35,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 4398, now seen corresponding path program 1 times [2023-10-12 17:14:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500878732] [2023-10-12 17:14:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:14:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008285872] [2023-10-12 17:14:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 136445, now seen corresponding path program 1 times [2023-10-12 17:14:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549562] [2023-10-12 17:14:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,614 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:35,615 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:35,615 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:35,615 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:35,615 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:35,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:35,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:35,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:35,616 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:35,616 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:35,629 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:14:35,637 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:14:35,640 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:14:35,659 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:14:35,662 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:14:35,664 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:14:35,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:35,743 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,750 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:14:35,755 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:14:35,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,774 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:14:35,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,802 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:14:35,812 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:14:35,812 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:14:35,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,848 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:14:35,856 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:14:35,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,872 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:14:35,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,893 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:14:35,903 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:14:35,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,928 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:14:35,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:35,957 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:35,957 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,962 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:14:35,964 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:14:35,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:35,997 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:35,997 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:35,998 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:36,004 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:14:36,007 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:36,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,070 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,071 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:14:36,096 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:14:36,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 31 states, but on-demand construction may add more states Second 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:14:36,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 31 states, but on-demand construction may add more states. Second 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 85 states and 279 transitions. Complement of second has 5 states. [2023-10-12 17:14:36,184 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:14:36,188 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:14:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2023-10-12 17:14:36,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:36,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:36,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:36,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 279 transitions. [2023-10-12 17:14:36,200 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:36,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 185 transitions. [2023-10-12 17:14:36,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-10-12 17:14:36,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-10-12 17:14:36,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 185 transitions. [2023-10-12 17:14:36,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,206 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 185 transitions. [2023-10-12 17:14:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 185 transitions. [2023-10-12 17:14:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2023-10-12 17:14:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.525) internal successors, (141), 39 states have internal predecessors, (141), 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:14:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 141 transitions. [2023-10-12 17:14:36,230 INFO L241 hiAutomatonCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:36,230 INFO L430 stractBuchiCegarLoop]: Abstraction has 40 states and 141 transitions. [2023-10-12 17:14:36,230 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:36,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 141 transitions. [2023-10-12 17:14:36,231 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 19 [2023-10-12 17:14:36,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,232 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:36,232 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:36,233 INFO L748 eck$LassoCheckResult]: Stem: 292#[$Ultimate##0]don't care [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 226#[L61]don't care [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 228#[L23-1, L61-1]don't care [92] L61-1-->L34-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] 254#[L23-1, L34-1, L62]don't care [2023-10-12 17:14:36,233 INFO L750 eck$LassoCheckResult]: Loop: 254#[L23-1, L34-1, L62]don't care [105] L34-1-->L34-1: Formula: (and (= v_k_18 (+ v_k_19 1)) (= v_C_14 (store v_C_15 v_k_19 (+ (select v_A_9 v_k_19) 1))) (< v_k_19 v_N_21) (= v_k_18 v_p_11)) InVars {A=v_A_9, N=v_N_21, k=v_k_19, C=v_C_15} OutVars{A=v_A_9, p=v_p_11, N=v_N_21, k=v_k_18, C=v_C_14} AuxVars[] AssignedVars[p, k, C] 254#[L23-1, L34-1, L62]don't care [2023-10-12 17:14:36,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 136430, now seen corresponding path program 1 times [2023-10-12 17:14:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026090492] [2023-10-12 17:14:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:14:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635601820] [2023-10-12 17:14:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 4229435, now seen corresponding path program 1 times [2023-10-12 17:14:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598993995] [2023-10-12 17:14:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,361 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:36,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:36,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:36,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:36,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:36,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:36,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:36,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:14:36,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:36,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:36,364 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:14:36,369 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:14:36,372 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:14:36,375 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:14:36,379 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:14:36,401 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:14:36,405 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:14:36,408 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:14:36,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:36,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,508 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:14:36,520 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:14:36,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,535 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:14:36,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,557 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:14:36,561 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:14:36,562 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:14:36,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,595 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:14:36,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,680 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:14:36,682 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:14:36,683 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:14:36,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,726 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:14:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,728 INFO L229 MonitoredProcess]: Starting monitored process 10 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:14:36,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:14:36,738 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:14:36,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,797 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:14:36,806 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:14:36,807 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:14:36,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:36,857 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:36,857 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,861 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:14:36,864 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:14:36,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:36,897 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:36,898 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:36,898 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:14:36,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,902 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:36,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,939 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:14:36,940 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:14:36,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 141 transitions. cyclomatic complexity: 119 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 141 transitions. cyclomatic complexity: 119. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 122 states and 448 transitions. Complement of second has 4 states. [2023-10-12 17:14:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:36,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:36,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:36,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:36,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 448 transitions. [2023-10-12 17:14:37,003 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:37,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 80 states and 296 transitions. [2023-10-12 17:14:37,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-10-12 17:14:37,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-10-12 17:14:37,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 296 transitions. [2023-10-12 17:14:37,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:37,006 INFO L219 hiAutomatonCegarLoop]: Abstraction has 80 states and 296 transitions. [2023-10-12 17:14:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 296 transitions. [2023-10-12 17:14:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2023-10-12 17:14:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 3.953846153846154) internal successors, (257), 64 states have internal predecessors, (257), 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:14:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 257 transitions. [2023-10-12 17:14:37,013 INFO L241 hiAutomatonCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:37,013 INFO L430 stractBuchiCegarLoop]: Abstraction has 65 states and 257 transitions. [2023-10-12 17:14:37,013 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:37,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 257 transitions. [2023-10-12 17:14:37,014 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2023-10-12 17:14:37,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:37,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:37,015 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:37,015 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:37,015 INFO L748 eck$LassoCheckResult]: Stem: 548#[$Ultimate##0]don't care [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 496#[L61]don't care [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 498#[L23-1, L61-1]don't care [92] L61-1-->L34-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] 476#[L23-1, L34-1, L62]don't care [95] L62-->L46-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] 488#[L34-1, L63, L23-1, L46-1]don't care [2023-10-12 17:14:37,016 INFO L750 eck$LassoCheckResult]: Loop: 488#[L34-1, L63, L23-1, L46-1]don't care [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 488#[L34-1, L63, L23-1, L46-1]don't care [2023-10-12 17:14:37,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 4229425, now seen corresponding path program 1 times [2023-10-12 17:14:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275565299] [2023-10-12 17:14:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash 132, now seen corresponding path program 1 times [2023-10-12 17:14:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966853064] [2023-10-12 17:14:37,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash 131112276, now seen corresponding path program 1 times [2023-10-12 17:14:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17150930] [2023-10-12 17:14:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,191 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:37 BoogieIcfgContainer [2023-10-12 17:14:37,191 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:37,193 INFO L158 Benchmark]: Toolchain (without parser) took 2611.75ms. Allocated memory was 177.2MB in the beginning and 233.8MB in the end (delta: 56.6MB). Free memory was 131.1MB in the beginning and 143.6MB in the end (delta: -12.5MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,193 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 177.2MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:37,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.82ms. Allocated memory is still 177.2MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,198 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,198 INFO L158 Benchmark]: RCFGBuilder took 281.65ms. Allocated memory is still 177.2MB. Free memory was 128.5MB in the beginning and 118.3MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,199 INFO L158 Benchmark]: BuchiAutomizer took 2279.02ms. Allocated memory was 177.2MB in the beginning and 233.8MB in the end (delta: 56.6MB). Free memory was 118.1MB in the beginning and 143.6MB in the end (delta: -25.5MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.29ms. Allocated memory is still 177.2MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.82ms. Allocated memory is still 177.2MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.65ms. Allocated memory is still 177.2MB. Free memory was 128.5MB in the beginning and 118.3MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2279.02ms. Allocated memory was 177.2MB in the beginning and 233.8MB in the end (delta: 56.6MB). Free memory was 118.1MB in the beginning and 143.6MB in the end (delta: -25.5MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. The remainder module has 65 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp61 ukn80 mio100 lsp83 div100 bol100 ite100 ukn100 eq172 hnf91 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 97, unknown conditional: 0, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:14:37,225 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:14:37,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...