/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:21:14,214 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:21:14,273 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:21:14,299 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:21:14,300 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:21:14,300 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:21:14,301 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:21:14,301 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:21:14,302 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:21:14,305 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:21:14,305 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:21:14,305 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:21:14,305 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:21:14,306 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:21:14,306 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:21:14,306 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:21:14,307 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:21:14,308 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:21:14,309 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:21:14,309 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:21:14,310 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:21:14,310 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:21:14,311 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:21:14,311 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:21:14,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:21:14,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:21:14,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:21:14,513 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:21:14,513 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:21:14,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl [2023-10-12 17:21:14,515 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2023-10-12 17:21:14,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:21:14,532 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:21:14,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:14,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:21:14,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:21:14,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,550 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:21:14,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:14,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:21:14,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:21:14,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:21:14,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:21:14,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:21:14,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:21:14,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:21:14,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/1) ... [2023-10-12 17:21:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:14,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:14,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:21:14,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2023-10-12 17:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2023-10-12 17:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2023-10-12 17:21:14,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2023-10-12 17:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2023-10-12 17:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2023-10-12 17:21:14,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:21:14,618 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2023-10-12 17:21:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2023-10-12 17:21:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2023-10-12 17:21:14,619 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:21:14,657 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:21:14,658 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:21:14,759 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:21:14,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:21:14,795 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:21:14,797 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:14 BoogieIcfgContainer [2023-10-12 17:21:14,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:21:14,798 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:21:14,798 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:21:14,804 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:21:14,804 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:14,804 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:14" (1/2) ... [2023-10-12 17:21:14,806 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65580338 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:21:14, skipping insertion in model container [2023-10-12 17:21:14,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:14,807 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:14" (2/2) ... [2023-10-12 17:21:14,815 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2023-10-12 17:21:14,906 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:21:14,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2023-10-12 17:21:14,942 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2023-10-12 17:21:14,942 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:21:14,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:21:14,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2023-10-12 17:21:14,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2023-10-12 17:21:14,951 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:21:14,961 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 65 flow [2023-10-12 17:21:14,963 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 65 flow [2023-10-12 17:21:14,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 65 flow [2023-10-12 17:21:14,969 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2023-10-12 17:21:14,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:21:14,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:21:14,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 290 [2023-10-12 17:21:15,193 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:21:15,194 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:21:15,204 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:21:15,204 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:21:15,204 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:21:15,204 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:21:15,204 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:21:15,204 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:21:15,204 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:21:15,204 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:21:15,205 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 16 transitions, 47 flow [2023-10-12 17:21:15,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:15,208 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:21:15,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:15,209 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:15,211 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:21:15,211 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 16 transitions, 47 flow [2023-10-12 17:21:15,212 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:15,212 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:21:15,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:15,212 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:15,217 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [108] $Ultimate##0-->L21-1: Formula: (and (= v_i1_23 0) (= 0 v_sum1_14)) InVars {} OutVars{sum1=v_sum1_14, i1=v_i1_23} AuxVars[] AssignedVars[sum1, i1] 43#[L21-1, L64]true [2023-10-12 17:21:15,217 INFO L750 eck$LassoCheckResult]: Loop: 43#[L21-1, L64]true [105] L21-1-->L21-1: Formula: (and (< v_i1_18 v_N_9) (= (+ (select v_A_17 v_i1_18) v_sum1_11) v_sum1_10) (= (+ v_i1_18 1) v_i1_17)) InVars {sum1=v_sum1_11, A=v_A_17, N=v_N_9, i1=v_i1_18} OutVars{sum1=v_sum1_10, A=v_A_17, N=v_N_9, i1=v_i1_17} AuxVars[] AssignedVars[sum1, i1] 43#[L21-1, L64]true [2023-10-12 17:21:15,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 4014, now seen corresponding path program 1 times [2023-10-12 17:21:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519781298] [2023-10-12 17:21:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:15,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:21:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963197996] [2023-10-12 17:21:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:15,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 124539, now seen corresponding path program 1 times [2023-10-12 17:21:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120470083] [2023-10-12 17:21:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:15,408 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:15,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:15,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:15,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:15,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:15,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:15,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:15,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:15,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:21:15,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:15,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:15,419 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:15,425 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:15,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:15,492 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:15,495 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:15,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:15,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:21:15,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:15,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:15,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:15,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:15,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:15,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:15,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:15,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:21:15,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:15,553 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:21:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:15,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:15,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:21:15,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:21:15,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:15,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:15,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:15,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:15,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:15,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:15,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:15,592 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:21:15,592 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:21:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:15,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:15,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:21:15,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:15,616 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:21:15,616 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:15,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:21:15,625 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:21:15,627 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:21:15,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:15,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:15,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:15,668 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:21:15,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:15,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:21:15,705 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:15,802 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 234 transitions. [2023-10-12 17:21:15,803 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:15,807 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-10-12 17:21:15,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:21:15,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:15,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:21:15,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:15,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:21:15,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:15,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 184 transitions, 916 flow [2023-10-12 17:21:15,909 INFO L124 PetriNetUnfolderBase]: 391/566 cut-off events. [2023-10-12 17:21:15,909 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-10-12 17:21:15,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 566 events. 391/566 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1895 event pairs, 8 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 1045. Up to 179 conditions per place. [2023-10-12 17:21:15,914 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 184 transitions, 916 flow [2023-10-12 17:21:15,921 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 184 transitions, 916 flow [2023-10-12 17:21:15,922 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 184 transitions, 916 flow [2023-10-12 17:21:15,922 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:21:15,922 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 184 transitions, 916 flow [2023-10-12 17:21:15,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:15,930 INFO L124 PetriNetUnfolderBase]: 21/40 cut-off events. [2023-10-12 17:21:15,933 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:21:15,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:15,933 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 87#[$Ultimate##0, $Ultimate##0, L65]true [112] $Ultimate##0-->L36-1: Formula: (and (= 0 v_sum2_16) (= v_i2_23 0)) InVars {} OutVars{sum2=v_sum2_16, i2=v_i2_23} AuxVars[] AssignedVars[sum2, i2] 89#[L36-1, $Ultimate##0, L65]true [2023-10-12 17:21:15,934 INFO L750 eck$LassoCheckResult]: Loop: 89#[L36-1, $Ultimate##0, L65]true [110] L36-1-->L36-1: Formula: (and (= (+ v_i2_20 1) v_i2_19) (< v_i2_20 v_N_17) (= (+ (select v_A_23 v_i2_20) v_sum2_11) v_sum2_10)) InVars {A=v_A_23, sum2=v_sum2_11, N=v_N_17, i2=v_i2_20} OutVars{A=v_A_23, sum2=v_sum2_10, N=v_N_17, i2=v_i2_19} AuxVars[] AssignedVars[sum2, i2] 89#[L36-1, $Ultimate##0, L65]true [110] L36-1-->L36-1: Formula: (and (= (+ v_i2_20 1) v_i2_19) (< v_i2_20 v_N_17) (= (+ (select v_A_23 v_i2_20) v_sum2_11) v_sum2_10)) InVars {A=v_A_23, sum2=v_sum2_11, N=v_N_17, i2=v_i2_20} OutVars{A=v_A_23, sum2=v_sum2_10, N=v_N_17, i2=v_i2_19} AuxVars[] AssignedVars[sum2, i2] 89#[L36-1, $Ultimate##0, L65]true [2023-10-12 17:21:15,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash 124236, now seen corresponding path program 1 times [2023-10-12 17:21:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014275059] [2023-10-12 17:21:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:15,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 1 times [2023-10-12 17:21:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741777406] [2023-10-12 17:21:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:15,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 119394316, now seen corresponding path program 1 times [2023-10-12 17:21:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285496630] [2023-10-12 17:21:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:15,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:16,037 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:16,038 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:16,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:16,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:16,038 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:16,038 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:16,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:16,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:16,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:21:16,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:16,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:16,041 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,062 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,064 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,067 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,070 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:16,122 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:16,122 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:16,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:16,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:16,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:16,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:21:16,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:21:16,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:16,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:16,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:16,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:16,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:16,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:16,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:16,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:16,174 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:21:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:16,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:16,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:21:16,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:21:16,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:16,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:16,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:16,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:16,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:16,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:16,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:16,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:16,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:16,213 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:21:16,217 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:21:16,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:21:16,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:16,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:16,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:16,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:16,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:16,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:16,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:16,268 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:21:16,268 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:21:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:16,615 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:21:16,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:16,629 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:21:16,647 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:21:16,648 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:16,648 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:21:16,654 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:21:16,658 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:21:16,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:16,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:16,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:16,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:21:16,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:16,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:21:16,694 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:21:16,794 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 310 transitions. [2023-10-12 17:21:16,794 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:16,808 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:16,809 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:21:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2023-10-12 17:21:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:21:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:21:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:21:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:16,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 2800 transitions, 19680 flow [2023-10-12 17:21:16,850 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:21:16,867 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:21:16,977 INFO L124 PetriNetUnfolderBase]: 1190/1664 cut-off events. [2023-10-12 17:21:16,977 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2023-10-12 17:21:16,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 1664 events. 1190/1664 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6698 event pairs, 14 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 4670. Up to 579 conditions per place. [2023-10-12 17:21:16,979 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 47 places, 2800 transitions, 19680 flow [2023-10-12 17:21:17,004 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 47 places, 2800 transitions, 19680 flow [2023-10-12 17:21:17,004 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 2800 transitions, 19680 flow [2023-10-12 17:21:17,004 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:21:17,004 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 2800 transitions, 19680 flow [2023-10-12 17:21:17,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:17,017 INFO L124 PetriNetUnfolderBase]: 47/83 cut-off events. [2023-10-12 17:21:17,017 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:21:17,017 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:17,018 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 41#[L64, $Ultimate##0]true [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 87#[$Ultimate##0, $Ultimate##0, L65]true [101] L65-->$Ultimate##0: Formula: (and (= 3 v_incThread1of1ForFork2_thidvar1_2) (= 3 v_incThread1of1ForFork2_thidvar2_2) (= 3 v_incThread1of1ForFork2_thidvar0_2)) InVars {} OutVars{incThread1of1ForFork2_thidvar2=v_incThread1of1ForFork2_thidvar2_2, incThread1of1ForFork2_thidvar1=v_incThread1of1ForFork2_thidvar1_2, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_12, incThread1of1ForFork2_thidvar0=v_incThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[incThread1of1ForFork2_thidvar2, incThread1of1ForFork2_thidvar1, incThread1of1ForFork2_j, incThread1of1ForFork2_thidvar0] 146#[L66, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j] 148#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2023-10-12 17:21:17,018 INFO L750 eck$LassoCheckResult]: Loop: 148#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [107] L51-1-->L51-1: Formula: (and (< v_incThread1of1ForFork2_j_16 v_N_13) (or (and (= v_A_19 (store v_A_20 v_incThread1of1ForFork2_j_16 (+ (select v_A_20 v_incThread1of1ForFork2_j_16) 1))) (< v_incThread1of1ForFork2_j_16 v_i2_15) (= v_incThread1of1ForFork2_j_15 (+ v_incThread1of1ForFork2_j_16 1)) (< v_incThread1of1ForFork2_j_16 v_i1_21)) (and (= v_incThread1of1ForFork2_j_16 v_incThread1of1ForFork2_j_15) (= v_A_19 v_A_20) (or (<= v_i2_15 v_incThread1of1ForFork2_j_16) (<= v_i1_21 v_incThread1of1ForFork2_j_16))))) InVars {A=v_A_20, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_16, N=v_N_13, i1=v_i1_21, i2=v_i2_15} OutVars{A=v_A_19, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_15, N=v_N_13, i1=v_i1_21, i2=v_i2_15} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j] 148#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [107] L51-1-->L51-1: Formula: (and (< v_incThread1of1ForFork2_j_16 v_N_13) (or (and (= v_A_19 (store v_A_20 v_incThread1of1ForFork2_j_16 (+ (select v_A_20 v_incThread1of1ForFork2_j_16) 1))) (< v_incThread1of1ForFork2_j_16 v_i2_15) (= v_incThread1of1ForFork2_j_15 (+ v_incThread1of1ForFork2_j_16 1)) (< v_incThread1of1ForFork2_j_16 v_i1_21)) (and (= v_incThread1of1ForFork2_j_16 v_incThread1of1ForFork2_j_15) (= v_A_19 v_A_20) (or (<= v_i2_15 v_incThread1of1ForFork2_j_16) (<= v_i1_21 v_incThread1of1ForFork2_j_16))))) InVars {A=v_A_20, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_16, N=v_N_13, i1=v_i1_21, i2=v_i2_15} OutVars{A=v_A_19, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_15, N=v_N_13, i1=v_i1_21, i2=v_i2_15} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j] 148#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2023-10-12 17:21:17,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash 3851063, now seen corresponding path program 1 times [2023-10-12 17:21:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133446326] [2023-10-12 17:21:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:17,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 4385, now seen corresponding path program 1 times [2023-10-12 17:21:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439766778] [2023-10-12 17:21:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:17,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -594092329, now seen corresponding path program 1 times [2023-10-12 17:21:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974484213] [2023-10-12 17:21:17,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:17,375 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:21:17 BoogieIcfgContainer [2023-10-12 17:21:17,376 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:21:17,376 INFO L158 Benchmark]: Toolchain (without parser) took 2844.41ms. Allocated memory was 183.5MB in the beginning and 225.4MB in the end (delta: 41.9MB). Free memory was 131.8MB in the beginning and 168.6MB in the end (delta: -36.8MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-10-12 17:21:17,377 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:21:17,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.18ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 130.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:21:17,378 INFO L158 Benchmark]: Boogie Preprocessor took 12.90ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 129.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:21:17,378 INFO L158 Benchmark]: RCFGBuilder took 231.41ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 118.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:21:17,378 INFO L158 Benchmark]: BuchiAutomizer took 2577.64ms. Allocated memory was 183.5MB in the beginning and 225.4MB in the end (delta: 41.9MB). Free memory was 118.4MB in the beginning and 168.6MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:21:17,379 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.26ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 172.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.18ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 130.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.90ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 129.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.41ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 118.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2577.64ms. Allocated memory was 183.5MB in the beginning and 225.4MB in the end (delta: 41.9MB). Free memory was 118.4MB in the beginning and 168.6MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. The remainder module has 19680 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 97 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp82 ukn85 mio100 lsp57 div100 bol100 ite100 ukn100 eq177 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 62ms VariablesStem: 1 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 49]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] Loop: [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 49]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L64] FORK 0 fork 1 sum1(); [L65] FORK 0 fork 2, 2 sum2(); [L66] FORK 0 fork 3, 3, 3 inc(); [L48] 3 j := 0; VAL [j=0] Loop: [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) [L49] COND TRUE j < N [L51] COND FALSE !(j < i1 && j < i2) 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, 25 TransitionsBefore, 16 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 138, independent: 138, independent conditional: 0, independent unconditional: 138, 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: 138, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 138, unknown conditional: 0, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, 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 incorrect! [2023-10-12 17:21:17,393 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...