/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/array-sum-with-log.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:47,845 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:47,890 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:36:47,910 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:47,910 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:47,911 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:47,912 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:47,912 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:47,912 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:47,913 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:47,913 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:47,913 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:47,914 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:47,914 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:47,914 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:47,915 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:47,915 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:47,915 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:47,916 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:47,916 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:47,916 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:47,917 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:47,917 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:47,917 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:47,917 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:47,918 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:47,918 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:47,918 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:47,918 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:47,919 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:47,919 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:47,919 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:47,919 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:47,920 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:47,920 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:36:48,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:48,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:48,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:48,148 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:48,150 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:48,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl [2023-10-12 17:36:48,151 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl' [2023-10-12 17:36:48,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:48,173 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:48,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:48,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:48,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:48,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,206 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2023-10-12 17:36:48,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:48,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:48,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:48,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:48,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:48,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:48,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:48,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:48,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/1) ... [2023-10-12 17:36:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:48,258 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:36:48,283 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:36:48,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:48,296 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:36:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:36:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:36:48,297 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:36:48,337 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:48,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:48,411 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:48,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:48,423 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:48,425 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:48 BoogieIcfgContainer [2023-10-12 17:36:48,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:48,426 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:48,426 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:48,430 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:48,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:48,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:48" (1/2) ... [2023-10-12 17:36:48,432 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f6ffc93 and model type array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:48, skipping insertion in model container [2023-10-12 17:36:48,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:48,432 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:48" (2/2) ... [2023-10-12 17:36:48,433 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log.bpl [2023-10-12 17:36:48,500 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:36:48,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 86 flow [2023-10-12 17:36:48,541 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2023-10-12 17:36:48,541 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:48,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 2/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:36:48,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 86 flow [2023-10-12 17:36:48,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 31 transitions, 74 flow [2023-10-12 17:36:48,553 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:48,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 74 flow [2023-10-12 17:36:48,567 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 74 flow [2023-10-12 17:36:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 74 flow [2023-10-12 17:36:48,576 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2023-10-12 17:36:48,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:48,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 2/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:36:48,578 INFO L119 LiptonReduction]: Number of co-enabled transitions 336 [2023-10-12 17:36:49,083 INFO L134 LiptonReduction]: Checked pairs total: 352 [2023-10-12 17:36:49,083 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:36:49,095 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:49,095 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:49,095 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:49,095 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:49,095 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:49,095 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:49,095 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:49,095 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:49,096 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:49,099 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][2], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][7]][6:3A:[95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr][12], 7:4A:[89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr][9]] [2023-10-12 17:36:49,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:49,101 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:36:49,102 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:36:49,102 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:49,104 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:49,105 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:49,107 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][2], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][7]][6:3A:[95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr][12], 7:4A:[89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr][9]] [2023-10-12 17:36:49,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:49,107 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:36:49,107 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:36:49,107 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:49,111 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 44#[L54, $Ultimate##0]true [86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1] 46#[L54, L39-1]true [2023-10-12 17:36:49,112 INFO L750 eck$LassoCheckResult]: Loop: 46#[L54, L39-1]true [95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr] 49#[L54, L25-2]true [89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr] 46#[L54, L39-1]true [2023-10-12 17:36:49,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 3341, now seen corresponding path program 1 times [2023-10-12 17:36:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200811256] [2023-10-12 17:36:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:49,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 3995, now seen corresponding path program 1 times [2023-10-12 17:36:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355701472] [2023-10-12 17:36:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:49,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 3213735, now seen corresponding path program 1 times [2023-10-12 17:36:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:49,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332071814] [2023-10-12 17:36:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:49,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:49,434 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:49,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:49,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:49,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:49,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:49,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:49,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:49,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:49,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:49,436 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:49,449 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:36:49,458 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:36:49,568 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:49,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:49,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,581 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:36:49,585 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:36:49,586 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:36:49,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:49,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:49,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:49,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:49,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:49,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:49,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:49,625 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:36:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,629 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:36:49,639 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:36:49,640 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:36:49,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:49,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:49,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:49,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:49,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:49,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:49,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:49,692 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:36:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,694 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:36:49,703 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:36:49,713 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:36:49,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:49,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:49,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:49,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:49,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:49,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:49,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:49,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:49,737 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:36:49,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,739 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:36:49,741 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:36:49,742 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:36:49,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:49,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:49,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:49,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:49,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:49,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:49,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:49,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:49,765 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:36:49,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,766 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:36:49,768 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:36:49,770 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:36:49,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:49,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:49,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:49,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:49,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:49,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:49,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:49,828 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:36:49,829 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:49,845 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:36:49,849 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:36:49,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:49,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:49,906 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:49,907 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2023-10-12 17:36:49,911 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:36:49,925 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:36:49,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:49,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:49,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:49,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:49,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:49,989 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:36:50,015 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:36:50,133 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:36:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:36:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-10-12 17:36:50,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:50,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:50,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:36:50,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,149 INFO L430 stractBuchiCegarLoop]: Abstraction has has 23 places, 56 transitions, 272 flow [2023-10-12 17:36:50,150 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:50,150 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 56 transitions, 272 flow [2023-10-12 17:36:50,157 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][11], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][31], 4:3A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][0]][18:4A:[95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr][50], 19:5A:[89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr][36]] [2023-10-12 17:36:50,161 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][11], 2:2A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][3], 5:3A:[82] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork1_x#1_15| 0) (= |v_sumThread1of1ForFork1_i#1_17| 0)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_15|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_17|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_i#1][23]][27:4A:[96] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork1_x#1_31| |v_sumThread1of1ForFork1_log_msg#1_45|) (< |v_sumThread1of1ForFork1_i#1_32| v_N_15) (= (+ (select v_A_12 |v_sumThread1of1ForFork1_i#1_32|) |v_sumThread1of1ForFork1_x#1_32|) |v_sumThread1of1ForFork1_x#1_31|) (= (+ |v_sumThread1of1ForFork1_i#1_32| 1) |v_sumThread1of1ForFork1_i#1_31|) (= (+ v_stdout_ptr_94 1) v_stdout_ptr_93) (= (store v_stdout_92 v_stdout_ptr_94 |v_sumThread1of1ForFork1_i#1_31|) v_stdout_91)) InVars {A=v_A_12, stdout=v_stdout_92, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_32|, N=v_N_15, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_32|, stdout_ptr=v_stdout_ptr_94} OutVars{A=v_A_12, stdout=v_stdout_91, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_31|, N=v_N_15, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_45|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_31|, stdout_ptr=v_stdout_ptr_93} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_i#1, stdout_ptr][55], 28:5A:[88] L25-2-->L39-1: Formula: (and (= (+ v_stdout_ptr_42 1) v_stdout_ptr_41) (= (store v_stdout_40 v_stdout_ptr_42 |v_sumThread1of1ForFork1_log_msg#1_23|) v_stdout_39)) InVars {stdout=v_stdout_40, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_42} OutVars{stdout=v_stdout_39, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_41} AuxVars[] AssignedVars[stdout, stdout_ptr][35]] [2023-10-12 17:36:50,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:50,161 INFO L124 PetriNetUnfolderBase]: 12/27 cut-off events. [2023-10-12 17:36:50,161 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:50,161 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:50,162 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 44#[L54, $Ultimate##0]true [77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] 92#[$Ultimate##0, $Ultimate##0, L55]true [82] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork1_x#1_15| 0) (= |v_sumThread1of1ForFork1_i#1_17| 0)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_15|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_17|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_i#1] 94#[L39-1, $Ultimate##0, L55]true [2023-10-12 17:36:50,162 INFO L750 eck$LassoCheckResult]: Loop: 94#[L39-1, $Ultimate##0, L55]true [96] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork1_x#1_31| |v_sumThread1of1ForFork1_log_msg#1_45|) (< |v_sumThread1of1ForFork1_i#1_32| v_N_15) (= (+ (select v_A_12 |v_sumThread1of1ForFork1_i#1_32|) |v_sumThread1of1ForFork1_x#1_32|) |v_sumThread1of1ForFork1_x#1_31|) (= (+ |v_sumThread1of1ForFork1_i#1_32| 1) |v_sumThread1of1ForFork1_i#1_31|) (= (+ v_stdout_ptr_94 1) v_stdout_ptr_93) (= (store v_stdout_92 v_stdout_ptr_94 |v_sumThread1of1ForFork1_i#1_31|) v_stdout_91)) InVars {A=v_A_12, stdout=v_stdout_92, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_32|, N=v_N_15, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_32|, stdout_ptr=v_stdout_ptr_94} OutVars{A=v_A_12, stdout=v_stdout_91, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_31|, N=v_N_15, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_45|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_31|, stdout_ptr=v_stdout_ptr_93} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_i#1, stdout_ptr] 97#[L25-2, $Ultimate##0, L55]true [88] L25-2-->L39-1: Formula: (and (= (+ v_stdout_ptr_42 1) v_stdout_ptr_41) (= (store v_stdout_40 v_stdout_ptr_42 |v_sumThread1of1ForFork1_log_msg#1_23|) v_stdout_39)) InVars {stdout=v_stdout_40, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_42} OutVars{stdout=v_stdout_39, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_41} AuxVars[] AssignedVars[stdout, stdout_ptr] 94#[L39-1, $Ultimate##0, L55]true [2023-10-12 17:36:50,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash 103374, now seen corresponding path program 1 times [2023-10-12 17:36:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084641514] [2023-10-12 17:36:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:50,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 4025, now seen corresponding path program 1 times [2023-10-12 17:36:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437125051] [2023-10-12 17:36:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:50,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash 99345478, now seen corresponding path program 1 times [2023-10-12 17:36:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:50,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033938741] [2023-10-12 17:36:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:50,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:50,320 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:50,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:50,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:50,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:50,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:50,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:50,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:50,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:50,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:50,322 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:50,324 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:36:50,326 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:36:50,347 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:36:50,350 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:36:50,355 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:36:50,358 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:36:50,360 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:36:50,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:50,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,453 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:36:50,456 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:36:50,458 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:36:50,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:50,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:50,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:50,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:50,484 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:36:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,498 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:36:50,499 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:36:50,502 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:36:50,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:50,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:50,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:50,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:50,526 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:36:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:36:50,593 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:36:50,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:50,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:50,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:50,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:50,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:50,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,607 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:50,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:36:50,611 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:36:50,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:50,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:50,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:50,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:50,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,650 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:50,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:36:50,664 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:36:50,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:50,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:50,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:50,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,700 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:50,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:36:50,719 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:36:50,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:50,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:50,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:50,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:50,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:50,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:50,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:50,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:50,750 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:50,757 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:50,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:36:50,762 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:50,798 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:50,798 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:50,798 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2023-10-12 17:36:50,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:50,806 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:36:50,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:50,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:50,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:50,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:50,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:50,857 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:36:50,858 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:36:50,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:50,980 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:36:50,996 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:36:50,996 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:36:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-10-12 17:36:50,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 150 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:36:50,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:50,998 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 224 transitions, 1536 flow [2023-10-12 17:36:50,999 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:50,999 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 224 transitions, 1536 flow [2023-10-12 17:36:51,004 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][45], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][125], 4:3A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][1]][17:4A:[95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr][201], 18:5A:[89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr][145]] [2023-10-12 17:36:51,012 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][45], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][125], 4:3A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][1], 13:4A:[82] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork1_x#1_15| 0) (= |v_sumThread1of1ForFork1_i#1_17| 0)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_15|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_17|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_i#1][89], 33:5A:[84] L39-1-->sumEXIT: Formula: (<= v_N_3 |v_sumThread1of1ForFork1_i#1_19|) InVars {N=v_N_3, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_19|} OutVars{N=v_N_3, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_19|} AuxVars[] AssignedVars[][168]][71:6A:[95] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork0_x#1_33| |v_sumThread1of1ForFork0_log_msg#1_43|) (= |v_sumThread1of1ForFork0_i#1_33| (+ |v_sumThread1of1ForFork0_i#1_34| 1)) (< |v_sumThread1of1ForFork0_i#1_34| v_N_13) (= (+ v_stdout_ptr_90 1) v_stdout_ptr_89) (= (+ (select v_A_10 |v_sumThread1of1ForFork0_i#1_34|) |v_sumThread1of1ForFork0_x#1_34|) |v_sumThread1of1ForFork0_x#1_33|) (= (store v_stdout_88 v_stdout_ptr_90 |v_sumThread1of1ForFork0_i#1_33|) v_stdout_87)) InVars {A=v_A_10, stdout=v_stdout_88, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_34|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_34|, stdout_ptr=v_stdout_ptr_90} OutVars{A=v_A_10, stdout=v_stdout_87, N=v_N_13, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_33|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_43|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_33|, stdout_ptr=v_stdout_ptr_89} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, stdout_ptr][203], 72:7A:[89] L25-2-->L39-1: Formula: (and (= v_stdout_ptr_51 (+ v_stdout_ptr_52 1)) (= (store v_stdout_50 v_stdout_ptr_52 |v_sumThread1of1ForFork0_log_msg#1_23|) v_stdout_49)) InVars {stdout=v_stdout_50, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_52} OutVars{stdout=v_stdout_49, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_23|, stdout_ptr=v_stdout_ptr_51} AuxVars[] AssignedVars[stdout, stdout_ptr][147]] [2023-10-12 17:36:51,014 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][45], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][125], 4:3A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][1], 13:4A:[82] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork1_x#1_15| 0) (= |v_sumThread1of1ForFork1_i#1_17| 0)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_15|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_17|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_i#1][89], 34:5A:[91] L39-1-->sumEXIT: Formula: (<= v_N_7 |v_sumThread1of1ForFork0_i#1_23|) InVars {N=v_N_7, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_23|} OutVars{N=v_N_7, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_23|} AuxVars[] AssignedVars[][184]][75:6A:[96] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork1_x#1_31| |v_sumThread1of1ForFork1_log_msg#1_45|) (< |v_sumThread1of1ForFork1_i#1_32| v_N_15) (= (+ (select v_A_12 |v_sumThread1of1ForFork1_i#1_32|) |v_sumThread1of1ForFork1_x#1_32|) |v_sumThread1of1ForFork1_x#1_31|) (= (+ |v_sumThread1of1ForFork1_i#1_32| 1) |v_sumThread1of1ForFork1_i#1_31|) (= (+ v_stdout_ptr_94 1) v_stdout_ptr_93) (= (store v_stdout_92 v_stdout_ptr_94 |v_sumThread1of1ForFork1_i#1_31|) v_stdout_91)) InVars {A=v_A_12, stdout=v_stdout_92, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_32|, N=v_N_15, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_32|, stdout_ptr=v_stdout_ptr_94} OutVars{A=v_A_12, stdout=v_stdout_91, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_31|, N=v_N_15, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_45|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_31|, stdout_ptr=v_stdout_ptr_93} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_i#1, stdout_ptr][219], 76:7A:[88] L25-2-->L39-1: Formula: (and (= (+ v_stdout_ptr_42 1) v_stdout_ptr_41) (= (store v_stdout_40 v_stdout_ptr_42 |v_sumThread1of1ForFork1_log_msg#1_23|) v_stdout_39)) InVars {stdout=v_stdout_40, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_42} OutVars{stdout=v_stdout_39, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_41} AuxVars[] AssignedVars[stdout, stdout_ptr][136]] [2023-10-12 17:36:51,015 ERROR L47 etriNetUnfolderRabin]: [1:1A:[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_10|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0][45], 3:2A:[86] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork0_i#1_21| 0) (= |v_sumThread1of1ForFork0_x#1_19| 0)) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_19|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_21|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_i#1][125], 4:3A:[77] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_10|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1][1], 14:4A:[91] L39-1-->sumEXIT: Formula: (<= v_N_7 |v_sumThread1of1ForFork0_i#1_23|) InVars {N=v_N_7, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_23|} OutVars{N=v_N_7, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_23|} AuxVars[] AssignedVars[][185], 36:5A:[82] $Ultimate##0-->L39-1: Formula: (and (= |v_sumThread1of1ForFork1_x#1_15| 0) (= |v_sumThread1of1ForFork1_i#1_17| 0)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_15|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_17|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_i#1][89], 57:6A:[78] sumEXIT-->L56: Formula: (and (= v_sumThread1of1ForFork0_thidvar0_4 1) (= |v_sumThread1of1ForFork0_x#1_12| v_ULTIMATE.start_x_4)) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_12|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_4} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_12|, ULTIMATE.start_x=v_ULTIMATE.start_x_4, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_x][24]][84:7A:[96] L39-1-->L25-2: Formula: (and (= |v_sumThread1of1ForFork1_x#1_31| |v_sumThread1of1ForFork1_log_msg#1_45|) (< |v_sumThread1of1ForFork1_i#1_32| v_N_15) (= (+ (select v_A_12 |v_sumThread1of1ForFork1_i#1_32|) |v_sumThread1of1ForFork1_x#1_32|) |v_sumThread1of1ForFork1_x#1_31|) (= (+ |v_sumThread1of1ForFork1_i#1_32| 1) |v_sumThread1of1ForFork1_i#1_31|) (= (+ v_stdout_ptr_94 1) v_stdout_ptr_93) (= (store v_stdout_92 v_stdout_ptr_94 |v_sumThread1of1ForFork1_i#1_31|) v_stdout_91)) InVars {A=v_A_12, stdout=v_stdout_92, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_32|, N=v_N_15, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_32|, stdout_ptr=v_stdout_ptr_94} OutVars{A=v_A_12, stdout=v_stdout_91, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_31|, N=v_N_15, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_45|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_31|, stdout_ptr=v_stdout_ptr_93} AuxVars[] AssignedVars[stdout, sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_i#1, stdout_ptr][219], 85:8A:[88] L25-2-->L39-1: Formula: (and (= (+ v_stdout_ptr_42 1) v_stdout_ptr_41) (= (store v_stdout_40 v_stdout_ptr_42 |v_sumThread1of1ForFork1_log_msg#1_23|) v_stdout_39)) InVars {stdout=v_stdout_40, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_42} OutVars{stdout=v_stdout_39, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_23|, stdout_ptr=v_stdout_ptr_41} AuxVars[] AssignedVars[stdout, stdout_ptr][136]] [2023-10-12 17:36:51,017 INFO L124 PetriNetUnfolderBase]: 52/96 cut-off events. [2023-10-12 17:36:51,017 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:36:51,017 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:36:51,023 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:51 BoogieIcfgContainer [2023-10-12 17:36:51,023 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:51,024 INFO L158 Benchmark]: Toolchain (without parser) took 2849.98ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 139.6MB in the beginning and 228.6MB in the end (delta: -89.0MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:51,024 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:51,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.49ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:51,025 INFO L158 Benchmark]: Boogie Preprocessor took 17.41ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:51,025 INFO L158 Benchmark]: RCFGBuilder took 198.36ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 127.0MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:51,026 INFO L158 Benchmark]: BuchiAutomizer took 2597.06ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 126.7MB in the beginning and 228.6MB in the end (delta: -101.9MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:51,027 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.22ms. Allocated memory is still 184.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.49ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.41ms. Allocated memory is still 184.5MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.36ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 127.0MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2597.06ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 126.7MB in the beginning and 228.6MB in the end (delta: -101.9MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 94 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital48 mio100 ax100 hnf100 lsp87 ukn72 mio100 lsp44 div100 bol100 ite100 ukn100 eq218 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 36 PlacesBefore, 19 PlacesAfterwards, 31 TransitionsBefore, 14 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 229, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 229, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 229, unknown conditional: 0, unknown unconditional: 229] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:36:51,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...