/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 RABIN_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:37:24,615 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:24,697 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:37:24,727 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:24,728 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:24,729 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:24,730 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:24,730 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:24,731 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:24,734 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:24,734 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:24,734 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:24,735 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:24,736 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:24,736 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:24,737 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:24,737 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:24,737 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:24,737 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:24,737 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:24,738 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:24,739 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:24,739 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:24,739 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:24,739 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:24,740 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:24,740 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:24,740 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:24,740 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:24,740 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:24,741 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:24,741 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:24,742 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:24,743 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:24,743 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 -> RABIN_PETRI_NET [2023-10-12 17:37:24,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:24,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:24,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:24,964 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:24,964 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:24,965 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:37:24,966 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2023-10-12 17:37:24,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:24,986 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:24,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:24,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:24,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:24,998 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:37:24" (1/1) ... [2023-10-12 17:37:25,005 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:37:24" (1/1) ... [2023-10-12 17:37:25,011 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:25,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:25,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:25,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:25,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:25,023 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:37:24" (1/1) ... [2023-10-12 17:37:25,023 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:37:24" (1/1) ... [2023-10-12 17:37:25,025 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:37:24" (1/1) ... [2023-10-12 17:37:25,025 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:37:24" (1/1) ... [2023-10-12 17:37:25,028 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:37:24" (1/1) ... [2023-10-12 17:37:25,032 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:37:24" (1/1) ... [2023-10-12 17:37:25,033 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:37:24" (1/1) ... [2023-10-12 17:37:25,033 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:37:24" (1/1) ... [2023-10-12 17:37:25,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:25,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:25,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:25,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:25,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/1) ... [2023-10-12 17:37:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:25,070 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:37:25,085 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:37:25,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2023-10-12 17:37:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2023-10-12 17:37:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2023-10-12 17:37:25,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2023-10-12 17:37:25,116 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2023-10-12 17:37:25,116 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2023-10-12 17:37:25,116 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:25,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:25,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:25,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2023-10-12 17:37:25,117 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2023-10-12 17:37:25,117 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2023-10-12 17:37:25,118 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:37:25,170 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:25,172 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:25,283 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:25,305 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:25,305 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:25,334 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:25 BoogieIcfgContainer [2023-10-12 17:37:25,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:25,335 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:25,335 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:25,351 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:25,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:25,352 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:24" (1/2) ... [2023-10-12 17:37:25,354 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cd35471 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:25, skipping insertion in model container [2023-10-12 17:37:25,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:25,354 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:37:25" (2/2) ... [2023-10-12 17:37:25,361 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2023-10-12 17:37:25,418 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:25,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2023-10-12 17:37:25,470 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2023-10-12 17:37:25,471 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:25,474 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:37:25,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2023-10-12 17:37:25,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2023-10-12 17:37:25,480 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:25,494 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 65 flow [2023-10-12 17:37:25,496 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 65 flow [2023-10-12 17:37:25,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 65 flow [2023-10-12 17:37:25,503 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2023-10-12 17:37:25,503 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:25,503 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:37:25,504 INFO L119 LiptonReduction]: Number of co-enabled transitions 290 [2023-10-12 17:37:25,746 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:37:25,747 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:37:25,762 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:25,763 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:25,763 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:25,763 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:25,763 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:25,763 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:25,763 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:25,763 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:25,764 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 16 transitions, 47 flow [2023-10-12 17:37:25,768 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][5], 3:2A:[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][10]][4:3A:[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][8]] [2023-10-12 17:37:25,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:25,771 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:25,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:25,772 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:25,776 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:25,776 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 16 transitions, 47 flow [2023-10-12 17:37:25,778 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][5], 3:2A:[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][10]][4:3A:[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][8]] [2023-10-12 17:37:25,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:25,779 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:25,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:25,779 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:25,783 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:37:25,783 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:37:25,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 4014, now seen corresponding path program 1 times [2023-10-12 17:37:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889150803] [2023-10-12 17:37:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:25,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:37:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743236627] [2023-10-12 17:37:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:25,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 124539, now seen corresponding path program 1 times [2023-10-12 17:37:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398227713] [2023-10-12 17:37:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:25,954 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:25,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:25,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:25,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:25,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:25,955 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:25,955 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:25,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:25,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:25,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:25,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:25,967 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:37:25,974 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:37:25,995 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:37:26,058 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:26,061 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:26,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,064 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:37:26,070 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:37:26,072 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:37:26,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:26,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:26,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:26,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:26,089 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:37:26,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,163 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:37:26,165 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:37:26,167 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:37:26,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:26,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:26,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:26,225 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:26,225 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:26,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,266 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:37:26,267 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:37:26,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:26,275 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:26,275 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:26,276 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:37:26,281 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:37:26,284 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:26,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,340 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,340 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:37:26,381 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:37:26,488 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:37:26,489 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:37:26,494 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:37:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-10-12 17:37:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:26,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,500 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 64 transitions, 316 flow [2023-10-12 17:37:26,500 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:26,500 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 64 transitions, 316 flow [2023-10-12 17:37:26,504 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][23], 2:2A:[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][15], 13:3A:[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][63]][14:4A:[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][39]] [2023-10-12 17:37:26,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:26,504 INFO L124 PetriNetUnfolderBase]: 6/13 cut-off events. [2023-10-12 17:37:26,504 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:26,504 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:26,505 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] 78#[$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] 80#[L36-1, $Ultimate##0, L65]true [2023-10-12 17:37:26,505 INFO L750 eck$LassoCheckResult]: Loop: 80#[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] 80#[L36-1, $Ultimate##0, L65]true [2023-10-12 17:37:26,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash 124236, now seen corresponding path program 1 times [2023-10-12 17:37:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420261561] [2023-10-12 17:37:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:37:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240246866] [2023-10-12 17:37:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash 3851426, now seen corresponding path program 1 times [2023-10-12 17:37:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559004673] [2023-10-12 17:37:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,612 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:26,613 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:26,613 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:26,613 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:26,613 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:26,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:26,613 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:26,613 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:26,613 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:26,613 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:26,615 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:37:26,617 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:37:26,620 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:37:26,634 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:37:26,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:37:26,644 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:37:26,707 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:26,708 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,709 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:37:26,712 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:37:26,714 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:37:26,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:26,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:26,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:26,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:26,733 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:37:26,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,735 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:37:26,736 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:37:26,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:37:26,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:26,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:26,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:26,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:26,758 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:37:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,760 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:37:26,761 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:37:26,763 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:37:26,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:26,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:26,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:26,790 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:37:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,792 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:37:26,799 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:37:26,801 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:37:26,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:26,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:26,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:26,838 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:26,838 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:26,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,841 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:37:26,851 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:37:26,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:26,862 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:26,862 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:26,862 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:37:26,869 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:37:26,870 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:26,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,903 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,904 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:37:26,904 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:37:26,982 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:37:26,983 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:37:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-10-12 17:37:26,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:26,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:26,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 116 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:26,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,992 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 256 transitions, 1776 flow [2023-10-12 17:37:26,992 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:26,993 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 256 transitions, 1776 flow [2023-10-12 17:37:27,001 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][92], 2:2A:[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][60], 7:3A:[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][108], 17:4A:[88] $Ultimate##0-->L51-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j][44]][18:5A:[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][220]] [2023-10-12 17:37:27,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:27,001 INFO L124 PetriNetUnfolderBase]: 8/17 cut-off events. [2023-10-12 17:37:27,001 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:27,002 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:27,002 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] 78#[$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] 114#[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] 116#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2023-10-12 17:37:27,003 INFO L750 eck$LassoCheckResult]: Loop: 116#[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] 116#[L66, $Ultimate##0, L51-1, $Ultimate##0]true [2023-10-12 17:37:27,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash 3851063, now seen corresponding path program 1 times [2023-10-12 17:37:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765005054] [2023-10-12 17:37:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:37:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138094525] [2023-10-12 17:37:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 119383060, now seen corresponding path program 1 times [2023-10-12 17:37:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568067167] [2023-10-12 17:37:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,246 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:27 BoogieIcfgContainer [2023-10-12 17:37:27,247 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:27,247 INFO L158 Benchmark]: Toolchain (without parser) took 2260.78ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 139.3MB in the beginning and 212.0MB in the end (delta: -72.6MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2023-10-12 17:37:27,248 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 187.7MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:27,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 187.7MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:27,248 INFO L158 Benchmark]: Boogie Preprocessor took 20.14ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 136.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:27,249 INFO L158 Benchmark]: RCFGBuilder took 298.51ms. Allocated memory is still 187.7MB. Free memory was 136.6MB in the beginning and 160.1MB in the end (delta: -23.4MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2023-10-12 17:37:27,249 INFO L158 Benchmark]: BuchiAutomizer took 1912.09ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 160.1MB in the beginning and 212.0MB in the end (delta: -51.9MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:27,251 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.23ms. Allocated memory is still 187.7MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 187.7MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.14ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 136.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.51ms. Allocated memory is still 187.7MB. Free memory was 136.6MB in the beginning and 160.1MB in the end (delta: -23.4MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 1912.09ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 160.1MB in the beginning and 212.0MB in the end (delta: -51.9MB). Peak memory consumption was 52.1MB. 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 3 locations. The remainder module has 1776 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.1s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 80 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp80 ukn91 mio100 lsp57 div100 bol100 ite100 ukn100 eq183 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 186ms 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.3s - 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) 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) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 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:37:27,273 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:37:27,470 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...