/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:32:42,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:32:42,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:32:42,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:32:42,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:32:42,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:32:42,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:32:42,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:32:42,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:32:42,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:32:42,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:32:42,322 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:32:42,322 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:32:42,323 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:32:42,323 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:32:42,324 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:32:42,324 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:32:42,324 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:32:42,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:32:42,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:32:42,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:32:42,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:32:42,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:32:42,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:32:42,327 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:32:42,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:32:42,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:32:42,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:32:42,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:32:42,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:32:42,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:32:42,328 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:32:42,328 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:32:42,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:32:42,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:32:42,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:32:42,729 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:32:42,730 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:32:42,731 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-3threads.bpl [2024-02-10 01:32:42,731 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl' [2024-02-10 01:32:42,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:32:42,782 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:32:42,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:42,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:32:42,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:32:42,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,886 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-10 01:32:42,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:32:42,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:32:42,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:32:42,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:32:42,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:32:42,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:32:42,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:32:42,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:32:42,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/1) ... [2024-02-10 01:32:42,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:43,037 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) [2024-02-10 01:32:43,044 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 [2024-02-10 01:32:43,078 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:32:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:32:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:32:43,079 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 01:32:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 01:32:43,079 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 01:32:43,079 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:32:43,118 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:32:43,120 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:32:43,197 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:32:43,208 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:32:43,208 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:32:43,210 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:43 BoogieIcfgContainer [2024-02-10 01:32:43,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:32:43,211 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:32:43,211 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:32:43,214 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:32:43,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:43,214 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:32:42" (1/2) ... [2024-02-10 01:32:43,216 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30280728 and model type array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:32:43, skipping insertion in model container [2024-02-10 01:32:43,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:32:43,216 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:32:43" (2/2) ... [2024-02-10 01:32:43,217 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-3threads.bpl [2024-02-10 01:32:43,301 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 01:32:43,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 129 flow [2024-02-10 01:32:43,345 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-02-10 01:32:43,345 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:32:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-10 01:32:43,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 129 flow [2024-02-10 01:32:43,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 48 transitions, 114 flow [2024-02-10 01:32:43,359 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:32:43,359 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:32:43,359 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:32:43,359 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:32:43,359 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:32:43,359 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:32:43,359 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:32:43,359 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:32:43,360 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:43,360 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 114 flow [2024-02-10 01:32:43,463 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 01:32:43,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 01:32:43,552 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2024-02-10 01:32:43,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:43,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:43,557 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:32:43,557 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:43,557 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 114 flow [2024-02-10 01:32:43,608 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 01:32:43,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2566 states, 2564 states have (on average 2.988299531981279) internal successors, (7662), 2565 states have internal predecessors, (7662), 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) [2024-02-10 01:32:43,642 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2024-02-10 01:32:43,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:43,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:43,648 INFO L748 eck$LassoCheckResult]: Stem: Black: 5195#[$Ultimate##0]don't care [95] $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_14|, 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] 5198#[L54, $Ultimate##0]don't care [54] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 5202#[L38, L54]don't care [55] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 5210#[L39-1, L54]don't care [2024-02-10 01:32:43,653 INFO L750 eck$LassoCheckResult]: Loop: 5210#[L39-1, L54]don't care [57] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 5226#[L40, L54]don't care [59] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 5254#[L41, L54]don't care [60] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 5300#[L44, L54]don't care [61] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5370#[L54, L25]don't care [62] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 5470#[L25-1, L54]don't care [63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5608#[L45, L54]don't care [64] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5788#[L25-2, L54]don't care [65] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 6010#[L25-3, L54]don't care [66] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 5210#[L39-1, L54]don't care [2024-02-10 01:32:43,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 122815, now seen corresponding path program 1 times [2024-02-10 01:32:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659487619] [2024-02-10 01:32:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:43,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1174385188, now seen corresponding path program 1 times [2024-02-10 01:32:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492021616] [2024-02-10 01:32:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:43,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1932215262, now seen corresponding path program 1 times [2024-02-10 01:32:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692075674] [2024-02-10 01:32:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:43,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:44,068 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:44,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:44,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:44,070 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:44,070 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:44,070 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,070 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:44,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:44,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:32:44,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:44,071 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:44,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:44,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:44,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:44,240 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:44,244 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,264 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) [2024-02-10 01:32:44,287 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 [2024-02-10 01:32:44,287 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 [2024-02-10 01:32:44,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:44,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:44,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:44,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:44,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:44,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:44,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:44,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:32:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,438 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) [2024-02-10 01:32:44,441 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 [2024-02-10 01:32:44,442 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 [2024-02-10 01:32:44,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:44,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:44,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:44,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:44,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:44,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:44,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:44,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 01:32:44,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,477 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) [2024-02-10 01:32:44,480 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 [2024-02-10 01:32:44,492 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 [2024-02-10 01:32:44,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:44,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:44,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:44,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:44,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:44,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:44,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:44,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:44,516 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 [2024-02-10 01:32:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,518 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) [2024-02-10 01:32:44,569 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 [2024-02-10 01:32:44,570 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 [2024-02-10 01:32:44,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:44,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:44,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:44,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:44,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:44,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:44,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:44,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:44,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:32:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,606 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) [2024-02-10 01:32:44,609 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 [2024-02-10 01:32:44,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:44,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:44,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:44,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:44,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:44,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:44,624 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 [2024-02-10 01:32:44,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:44,638 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:32:44,639 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:32:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:44,643 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) [2024-02-10 01:32:44,644 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 [2024-02-10 01:32:44,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:44,668 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:32:44,669 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:44,670 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2024-02-10 01:32:44,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 01:32:44,692 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:32:44,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:44,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:44,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:44,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:32:44,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:44,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:32:44,940 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-02-10 01:32:45,087 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 [2024-02-10 01:32:45,159 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 686 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:45,160 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:45,160 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:45,172 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:45,172 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-02-10 01:32:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-02-10 01:32:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-10 01:32:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-10 01:32:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-10 01:32:45,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:45,191 INFO L428 stractBuchiCegarLoop]: Abstraction has has 73 places, 1216 transitions, 5302 flow [2024-02-10 01:32:45,191 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:32:45,191 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:45,191 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 73 places, 1216 transitions, 5302 flow [2024-02-10 01:32:45,799 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 8056 states, 8046 states have (on average 3.988441461595824) internal successors, (32091), 8055 states have internal predecessors, (32091), 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) [2024-02-10 01:32:45,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8056 states, 8046 states have (on average 3.988441461595824) internal successors, (32091), 8055 states have internal predecessors, (32091), 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) [2024-02-10 01:32:45,897 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 4536 [2024-02-10 01:32:45,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:32:45,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:32:45,901 INFO L748 eck$LassoCheckResult]: Stem: Black: 10403#[$Ultimate##0]don't care [95] $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_14|, 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] Black: 10406#[L54, $Ultimate##0]don't care [98] 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_14|, 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] 10414#[$Ultimate##0, $Ultimate##0, L55]don't care [67] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] Black: 10448#[L38, $Ultimate##0, L55]don't care [68] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 10481#[L39-1, $Ultimate##0, L55]don't care [2024-02-10 01:32:45,901 INFO L750 eck$LassoCheckResult]: Loop: 10481#[L39-1, $Ultimate##0, L55]don't care [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] Black: 10573#[L40, $Ultimate##0, L55]don't care [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 10747#[L41, $Ultimate##0, L55]don't care [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] Black: 11043#[L44, $Ultimate##0, L55]don't care [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 11451#[L25, $Ultimate##0, L55]don't care [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 12059#[L25-1, $Ultimate##0, L55]don't care [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 12843#[L45, $Ultimate##0, L55]don't care [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] Black: 13793#[L25-2, $Ultimate##0, L55]don't care [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 14930#[L25-3, $Ultimate##0, L55]don't care [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] Black: 10488#[L39-1, $Ultimate##0, L55]don't care [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 10563#[L40, $Ultimate##0, L55]don't care [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] Black: 10754#[L41, $Ultimate##0, L55]don't care [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 11038#[L44, $Ultimate##0, L55]don't care [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] Black: 11453#[L25, $Ultimate##0, L55]don't care [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 12057#[L25-1, $Ultimate##0, L55]don't care [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] Black: 12845#[L45, $Ultimate##0, L55]don't care [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 13791#[L25-2, $Ultimate##0, L55]don't care [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 14932#[L25-3, $Ultimate##0, L55]don't care [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 10481#[L39-1, $Ultimate##0, L55]don't care [2024-02-10 01:32:45,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 3849989, now seen corresponding path program 1 times [2024-02-10 01:32:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331998157] [2024-02-10 01:32:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:45,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -281160447, now seen corresponding path program 1 times [2024-02-10 01:32:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955668944] [2024-02-10 01:32:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:45,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1787845381, now seen corresponding path program 1 times [2024-02-10 01:32:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:32:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712886690] [2024-02-10 01:32:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:32:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:32:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:32:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:32:45,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:32:46,146 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:32:46,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:32:46,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:32:46,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:32:46,146 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:32:46,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:32:46,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:32:46,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:32:46,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:32:46,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:32:46,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:32:46,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:32:46,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:32:46,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,269 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) [2024-02-10 01:32:46,274 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 [2024-02-10 01:32:46,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:46,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:46,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:46,284 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 [2024-02-10 01:32:46,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:46,307 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 [2024-02-10 01:32:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,309 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) [2024-02-10 01:32:46,314 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 [2024-02-10 01:32:46,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:46,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:46,326 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 [2024-02-10 01:32:46,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:46,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 01:32:46,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,342 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) [2024-02-10 01:32:46,347 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 [2024-02-10 01:32:46,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:46,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:46,359 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 [2024-02-10 01:32:46,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:46,388 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 [2024-02-10 01:32:46,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,390 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) [2024-02-10 01:32:46,397 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 [2024-02-10 01:32:46,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:46,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:46,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:46,407 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 [2024-02-10 01:32:46,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:46,420 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 [2024-02-10 01:32:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,431 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) [2024-02-10 01:32:46,432 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 [2024-02-10 01:32:46,444 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 [2024-02-10 01:32:46,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:32:46,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:32:46,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:32:46,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:32:46,469 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 [2024-02-10 01:32:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,470 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) [2024-02-10 01:32:46,475 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 [2024-02-10 01:32:46,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:32:46,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:32:46,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:32:46,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:32:46,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:32:46,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:32:46,489 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 [2024-02-10 01:32:46,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:32:46,503 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:32:46,503 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 01:32:46,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:32:46,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:32:46,504 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) [2024-02-10 01:32:46,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:32:46,518 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 [2024-02-10 01:32:46,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:32:46,527 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:32:46,528 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2024-02-10 01:32:46,533 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 [2024-02-10 01:32:46,536 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:32:46,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:32:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:46,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:32:46,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:32:46,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:32:46,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:32:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:32:46,628 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 01:32:46,629 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2024-02-10 01:32:46,717 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 634 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:32:46,718 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:32:46,718 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:32:46,854 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:32:46,854 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:32:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:32:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2024-02-10 01:32:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2024-02-10 01:32:46,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 4 letters. Loop has 18 letters. [2024-02-10 01:32:46,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:46,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 22 letters. Loop has 18 letters. [2024-02-10 01:32:46,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:46,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 4 letters. Loop has 36 letters. [2024-02-10 01:32:46,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:32:46,860 INFO L428 stractBuchiCegarLoop]: Abstraction has has 89 places, 28456 transitions, 180468 flow [2024-02-10 01:32:46,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:32:46,860 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:32:46,860 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 89 places, 28456 transitions, 180468 flow [2024-02-10 01:32:46,987 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 [2024-02-10 01:33:34,233 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 27349 states, 27280 states have (on average 5.2402126099706745) internal successors, (142953), 27348 states have internal predecessors, (142953), 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) [2024-02-10 01:33:34,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27349 states, 27280 states have (on average 5.2402126099706745) internal successors, (142953), 27348 states have internal predecessors, (142953), 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) [2024-02-10 01:33:34,662 INFO L131 ngComponentsAnalysis]: Automaton has 226 accepting balls. 4068 [2024-02-10 01:33:34,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:33:34,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:33:34,663 INFO L748 eck$LassoCheckResult]: Stem: Black: 32111#[$Ultimate##0]don't care [95] $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_14|, 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] Black: 32114#[L54, $Ultimate##0]don't care [98] 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_14|, 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] Black: 32128#[$Ultimate##0, $Ultimate##0, L55]don't care [101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1] 32194#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] Black: 32323#[L56, L38, $Ultimate##0, $Ultimate##0]don't care [81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 32584#[L56, L39-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:33:34,664 INFO L750 eck$LassoCheckResult]: Loop: 32584#[L56, L39-1, $Ultimate##0, $Ultimate##0]don't care [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] Black: 33141#[L56, L40, $Ultimate##0, $Ultimate##0]don't care [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 33941#[L56, L41, $Ultimate##0, $Ultimate##0]don't care [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] Black: 35150#[L56, L44, $Ultimate##0, $Ultimate##0]don't care [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 36813#[L56, L25, $Ultimate##0, $Ultimate##0]don't care [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 38995#[L56, L25-1, $Ultimate##0, $Ultimate##0]don't care [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 41682#[L45, L56, $Ultimate##0, $Ultimate##0]don't care [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 44887#[L25-2, L56, $Ultimate##0, $Ultimate##0]don't care [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 48566#[L56, L25-3, $Ultimate##0, $Ultimate##0]don't care [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 32591#[L56, L39-1, $Ultimate##0, $Ultimate##0]don't care [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 33126#[L56, L40, $Ultimate##0, $Ultimate##0]don't care [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] Black: 33948#[L56, L41, $Ultimate##0, $Ultimate##0]don't care [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 35143#[L56, L44, $Ultimate##0, $Ultimate##0]don't care [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 36820#[L56, L25, $Ultimate##0, $Ultimate##0]don't care [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 38988#[L56, L25-1, $Ultimate##0, $Ultimate##0]don't care [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] Black: 41689#[L45, L56, $Ultimate##0, $Ultimate##0]don't care [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 44880#[L25-2, L56, $Ultimate##0, $Ultimate##0]don't care [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] Black: 48573#[L56, L25-3, $Ultimate##0, $Ultimate##0]don't care [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 32584#[L56, L39-1, $Ultimate##0, $Ultimate##0]don't care [2024-02-10 01:33:34,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:33:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash 119382786, now seen corresponding path program 1 times [2024-02-10 01:33:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:33:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873490103] [2024-02-10 01:33:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:33:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:33:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:33:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:33:34,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:33:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1935588447, now seen corresponding path program 1 times [2024-02-10 01:33:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:33:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612604943] [2024-02-10 01:33:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:33:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:33:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:33:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:33:34,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:33:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 812025954, now seen corresponding path program 1 times [2024-02-10 01:33:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:33:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880640528] [2024-02-10 01:33:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:33:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:33:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:33:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:33:34,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:33:34,949 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:33:34,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:33:34,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:33:34,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:33:34,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:33:34,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:34,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:33:34,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:33:34,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:33:34,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:33:34,952 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:33:34,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:34,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:34,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:34,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:34,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:34,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:33:35,144 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:33:35,144 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:33:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,147 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:33:35,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:33:35,169 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 [2024-02-10 01:33:35,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:33:35,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:33:35,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:33:35,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:33:35,222 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 [2024-02-10 01:33:35,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:33:35,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:33:35,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:33:35,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:33:35,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,250 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:33:35,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 01:33:35,256 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 [2024-02-10 01:33:35,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:33:35,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:33:35,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,306 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:33:35,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 01:33:35,308 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 [2024-02-10 01:33:35,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:33:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:33:35,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:33:35,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,356 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:33:35,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 01:33:35,395 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 [2024-02-10 01:33:35,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:33:35,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:33:35,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,441 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-02-10 01:33:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 01:33:35,456 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 [2024-02-10 01:33:35,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:33:35,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:33:35,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:33:35,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:33:35,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-10 01:33:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,484 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-02-10 01:33:35,489 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 [2024-02-10 01:33:35,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:33:35,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:33:35,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:33:35,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:33:35,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:33:35,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:33:35,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 01:33:35,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:33:35,518 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 01:33:35,518 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 01:33:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:33:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:33:35,519 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-02-10 01:33:35,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:33:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-10 01:33:35,542 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:33:35,542 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:33:35,542 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i#1, N) = -1*sumThread1of1ForFork2_i#1 + 1*N Supporting invariants [] [2024-02-10 01:33:35,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-02-10 01:33:35,559 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:33:35,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:33:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:33:35,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:33:35,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:33:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:33:35,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:33:35,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:33:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:33:35,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 01:33:35,662 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-02-10 01:33:35,749 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 634 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:33:35,750 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:33:35,750 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:33:42,305 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:33:42,305 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:33:42,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:33:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-02-10 01:33:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2024-02-10 01:33:42,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 5 letters. Loop has 18 letters. [2024-02-10 01:33:42,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:33:42,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 23 letters. Loop has 18 letters. [2024-02-10 01:33:42,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:33:42,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 5 letters. Loop has 36 letters. [2024-02-10 01:33:42,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:33:42,316 INFO L428 stractBuchiCegarLoop]: Abstraction has has 105 places, 665472 transitions, 5538624 flow [2024-02-10 01:33:42,316 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:33:42,316 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:33:42,316 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 105 places, 665472 transitions, 5538624 flow [2024-02-10 01:34:03,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 Received shutdown request... [2024-02-10 01:36:52,507 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:36:52,561 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:36:52,566 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:36:52 BoogieIcfgContainer [2024-02-10 01:36:52,566 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:36:52,567 INFO L158 Benchmark]: Toolchain (without parser) took 249785.13ms. Allocated memory was 151.0MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 121.7MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2024-02-10 01:36:52,567 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 151.0MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:36:52,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.80ms. Allocated memory is still 151.0MB. Free memory was 121.7MB in the beginning and 119.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:36:52,568 INFO L158 Benchmark]: Boogie Preprocessor took 68.12ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 119.8MB in the beginning and 216.5MB in the end (delta: -96.7MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. [2024-02-10 01:36:52,568 INFO L158 Benchmark]: RCFGBuilder took 250.54ms. Allocated memory is still 243.3MB. Free memory was 216.5MB in the beginning and 207.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:36:52,568 INFO L158 Benchmark]: BuchiAutomizer took 249355.66ms. Allocated memory was 243.3MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 206.8MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2024-02-10 01:36:52,570 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.09ms. Allocated memory is still 151.0MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.80ms. Allocated memory is still 151.0MB. Free memory was 121.7MB in the beginning and 119.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.12ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 119.8MB in the beginning and 216.5MB in the end (delta: -96.7MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.54ms. Allocated memory is still 243.3MB. Free memory was 216.5MB in the beginning and 207.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 249355.66ms. Allocated memory was 243.3MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 206.8MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 5.9GB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. The remainder module has 5538624 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 249.2s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 18/18 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 324 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp86 ukn59 mio100 lsp46 div100 bol100 ite100 ukn100 eq201 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 87ms 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.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown