/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:06,687 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:06,748 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:06,779 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:06,780 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:06,780 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:06,782 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:06,782 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:06,782 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:06,785 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:06,785 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:06,785 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:06,785 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:06,786 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:06,787 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:06,787 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:06,787 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:06,787 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:06,788 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:06,789 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:06,789 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:06,789 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:06,789 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:06,789 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:06,789 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:06,790 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:06,790 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:06,790 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:06,791 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:06,792 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:06,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:06,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:07,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:07,002 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:07,002 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:07,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl [2023-10-12 17:37:07,004 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl' [2023-10-12 17:37:07,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:07,022 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:07,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:07,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:07,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:07,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,042 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:07,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:07,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:07,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:07,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:07,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:07,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:07,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:07,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:07,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/1) ... [2023-10-12 17:37:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:07,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:07,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:37:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:37:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:37:07,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:07,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:07,219 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:37:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:37:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:37:07,220 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:37:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:37:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:37:07,221 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:07,257 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:07,259 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:07,375 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:07,380 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:07,380 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:07,381 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:07 BoogieIcfgContainer [2023-10-12 17:37:07,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:07,382 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:07,382 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:07,389 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:07,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:07,390 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:07" (1/2) ... [2023-10-12 17:37:07,391 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207dedf and model type min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:07, skipping insertion in model container [2023-10-12 17:37:07,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:07,391 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:07" (2/2) ... [2023-10-12 17:37:07,392 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-nonatomic.bpl [2023-10-12 17:37:07,477 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:37:07,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 126 flow [2023-10-12 17:37:07,529 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2023-10-12 17:37:07,529 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:07,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:37:07,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 126 flow [2023-10-12 17:37:07,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 102 flow [2023-10-12 17:37:07,544 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:07,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 102 flow [2023-10-12 17:37:07,595 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 102 flow [2023-10-12 17:37:07,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 102 flow [2023-10-12 17:37:07,601 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2023-10-12 17:37:07,601 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:07,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:37:07,602 INFO L119 LiptonReduction]: Number of co-enabled transitions 738 [2023-10-12 17:37:07,947 INFO L134 LiptonReduction]: Checked pairs total: 878 [2023-10-12 17:37:07,948 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:37:07,956 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:07,957 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:07,957 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:07,957 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:07,957 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:07,957 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:07,957 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:07,957 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:07,958 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 22 transitions, 68 flow [2023-10-12 17:37:07,960 ERROR L47 etriNetUnfolderRabin]: [1:1A:[131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][10], 3:2A:[156] $Ultimate##0-->L28-1: Formula: (and (= v_computeMinThread1of1ForFork0_i1_27 0) (= (select v_A_49 0) v_array_min_23)) InVars {A=v_A_49} OutVars{A=v_A_49, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_27, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][17]][4:3A:[165] L28-1-->L28-1: Formula: (let ((.cse1 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_3)) (.cse0 (let ((.cse3 (select v_A_In_3 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and (<= v_array_min_In_1 .cse0) .cse1 (= v_array_min_Out_2 v_array_min_In_1) .cse2) (and .cse1 (= v_array_min_Out_2 .cse0) .cse2 (< .cse0 v_array_min_In_1)))) InVars {A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_3} OutVars{A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_3} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][21]] [2023-10-12 17:37:07,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:07,961 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:07,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:07,961 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:07,963 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:07,964 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 22 transitions, 68 flow [2023-10-12 17:37:07,965 ERROR L47 etriNetUnfolderRabin]: [1:1A:[131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][10], 3:2A:[156] $Ultimate##0-->L28-1: Formula: (and (= v_computeMinThread1of1ForFork0_i1_27 0) (= (select v_A_49 0) v_array_min_23)) InVars {A=v_A_49} OutVars{A=v_A_49, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_27, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][17]][4:3A:[165] L28-1-->L28-1: Formula: (let ((.cse1 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_3)) (.cse0 (let ((.cse3 (select v_A_In_3 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and (<= v_array_min_In_1 .cse0) .cse1 (= v_array_min_Out_2 v_array_min_In_1) .cse2) (and .cse1 (= v_array_min_Out_2 .cse0) .cse2 (< .cse0 v_array_min_In_1)))) InVars {A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_3} OutVars{A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_3} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][21]] [2023-10-12 17:37:07,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:07,965 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:07,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:07,965 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:07,968 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[$Ultimate##0, L79]true [156] $Ultimate##0-->L28-1: Formula: (and (= v_computeMinThread1of1ForFork0_i1_27 0) (= (select v_A_49 0) v_array_min_23)) InVars {A=v_A_49} OutVars{A=v_A_49, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_27, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 58#[L28-1, L79]true [2023-10-12 17:37:07,969 INFO L750 eck$LassoCheckResult]: Loop: 58#[L28-1, L79]true [165] L28-1-->L28-1: Formula: (let ((.cse1 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_3)) (.cse0 (let ((.cse3 (select v_A_In_3 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and (<= v_array_min_In_1 .cse0) .cse1 (= v_array_min_Out_2 v_array_min_In_1) .cse2) (and .cse1 (= v_array_min_Out_2 .cse0) .cse2 (< .cse0 v_array_min_In_1)))) InVars {A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_3} OutVars{A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_3} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 58#[L28-1, L79]true [2023-10-12 17:37:07,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 5178, now seen corresponding path program 1 times [2023-10-12 17:37:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483406665] [2023-10-12 17:37:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2023-10-12 17:37:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158564592] [2023-10-12 17:37:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash 160683, now seen corresponding path program 1 times [2023-10-12 17:37:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951071713] [2023-10-12 17:37:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,363 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:08,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:08,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:08,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:08,364 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:08,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:08,364 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:08,364 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:08,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:08,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:08,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:08,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:08,639 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:08,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:08,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:08,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:08,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:37:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:08,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:08,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:08,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,750 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:37:08,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,777 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:37:08,777 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:37:08,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:08,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:08,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:08,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:08,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:08,887 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:08,887 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:08,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:08,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:08,896 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:08,921 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:08,921 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:08,921 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2023-10-12 17:37:08,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:08,928 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:08,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,966 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:08,987 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2023-10-12 17:37:09,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:09,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:09,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:09,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,091 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 88 transitions, 448 flow [2023-10-12 17:37:09,091 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:09,091 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 35 places, 88 transitions, 448 flow [2023-10-12 17:37:09,093 ERROR L47 etriNetUnfolderRabin]: [1:1A:[131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][40], 2:2A:[134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][16], 6:3A:[146] $Ultimate##0-->L44-1: Formula: (and (= (select v_A_15 0) v_array_max_12) (= v_computeMaxThread1of1ForFork1_i2_19 0)) InVars {A=v_A_15} OutVars{A=v_A_15, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_19, array_max=v_array_max_12} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max][48]][7:4A:[163] L44-1-->L44-1: Formula: (let ((.cse0 (< v_computeMaxThread1of1ForFork1_i2_In_1 v_N_In_1)) (.cse1 (= v_computeMaxThread1of1ForFork1_i2_Out_2 (+ v_computeMaxThread1of1ForFork1_i2_In_1 1))) (.cse2 (let ((.cse3 (select v_A_In_1 v_computeMaxThread1of1ForFork1_i2_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and .cse0 (= v_array_max_In_1 v_array_max_Out_2) .cse1 (<= .cse2 v_array_max_In_1)) (and (< v_array_max_In_1 .cse2) .cse0 .cse1 (= v_array_max_Out_2 .cse2)))) InVars {A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_In_1, array_max=v_array_max_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_Out_2, array_max=v_array_max_Out_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max][80]] [2023-10-12 17:37:09,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:09,093 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2023-10-12 17:37:09,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:09,093 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:09,094 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[$Ultimate##0, L79]true [134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 93#[$Ultimate##0, $Ultimate##0, L80]true [146] $Ultimate##0-->L44-1: Formula: (and (= (select v_A_15 0) v_array_max_12) (= v_computeMaxThread1of1ForFork1_i2_19 0)) InVars {A=v_A_15} OutVars{A=v_A_15, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_19, array_max=v_array_max_12} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 95#[$Ultimate##0, L44-1, L80]true [2023-10-12 17:37:09,094 INFO L750 eck$LassoCheckResult]: Loop: 95#[$Ultimate##0, L44-1, L80]true [163] L44-1-->L44-1: Formula: (let ((.cse0 (< v_computeMaxThread1of1ForFork1_i2_In_1 v_N_In_1)) (.cse1 (= v_computeMaxThread1of1ForFork1_i2_Out_2 (+ v_computeMaxThread1of1ForFork1_i2_In_1 1))) (.cse2 (let ((.cse3 (select v_A_In_1 v_computeMaxThread1of1ForFork1_i2_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and .cse0 (= v_array_max_In_1 v_array_max_Out_2) .cse1 (<= .cse2 v_array_max_In_1)) (and (< v_array_max_In_1 .cse2) .cse0 .cse1 (= v_array_max_Out_2 .cse2)))) InVars {A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_In_1, array_max=v_array_max_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_Out_2, array_max=v_array_max_Out_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 95#[$Ultimate##0, L44-1, L80]true [2023-10-12 17:37:09,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash 159982, now seen corresponding path program 1 times [2023-10-12 17:37:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535037683] [2023-10-12 17:37:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 194, now seen corresponding path program 1 times [2023-10-12 17:37:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735757546] [2023-10-12 17:37:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 4959605, now seen corresponding path program 1 times [2023-10-12 17:37:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228743523] [2023-10-12 17:37:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,231 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:09,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:09,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:09,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:09,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:09,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:09,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:09,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:09,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:09,232 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:09,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:09,236 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:09,304 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:09,306 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:09,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:09,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:09,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:09,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:09,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:09,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:09,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:09,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:09,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:09,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:09,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:09,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:09,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:09,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:09,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:09,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:37:09,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:09,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:09,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:09,583 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:37:09,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:09,617 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:37:09,617 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:37:09,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:09,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:09,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:37:09,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:09,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:09,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:09,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:09,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:09,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:09,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:09,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:09,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:09,690 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:09,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:09,715 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:37:09,733 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:09,734 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:09,734 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, computeMaxThread1of1ForFork1_i2) = 1*N - 1*computeMaxThread1of1ForFork1_i2 Supporting invariants [] [2023-10-12 17:37:09,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:09,740 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:09,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:09,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:09,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:09,757 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:37:09,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:09,758 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2023-10-12 17:37:09,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:09,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:09,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:09,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,851 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 352 transitions, 2496 flow [2023-10-12 17:37:09,851 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:09,851 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 352 transitions, 2496 flow [2023-10-12 17:37:09,855 ERROR L47 etriNetUnfolderRabin]: [1:1A:[131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][163], 2:2A:[134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][67], 5:3A:[137] L80-->L68: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1][19]][20:4A:[117] L68-->L70: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l][51], 21:5A:[157] L70-->L68: Formula: (and (= (+ v_sampleThread1of1ForFork2_diff_5 v_sampleThread1of1ForFork2_min_l_9) v_sampleThread1of1ForFork2_max_l_13) (= v_array_max_31 v_sampleThread1of1ForFork2_max_l_13)) InVars {array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_13} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l][211]] [2023-10-12 17:37:09,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:09,855 INFO L124 PetriNetUnfolderBase]: 9/20 cut-off events. [2023-10-12 17:37:09,855 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:37:09,855 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:09,856 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[$Ultimate##0, L79]true [134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 93#[$Ultimate##0, $Ultimate##0, L80]true [137] L80-->L68: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 129#[$Ultimate##0, L68, $Ultimate##0, L81]true [2023-10-12 17:37:09,856 INFO L750 eck$LassoCheckResult]: Loop: 129#[$Ultimate##0, L68, $Ultimate##0, L81]true [117] L68-->L70: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l] 132#[$Ultimate##0, $Ultimate##0, L81, L70]true [157] L70-->L68: Formula: (and (= (+ v_sampleThread1of1ForFork2_diff_5 v_sampleThread1of1ForFork2_min_l_9) v_sampleThread1of1ForFork2_max_l_13) (= v_array_max_31 v_sampleThread1of1ForFork2_max_l_13)) InVars {array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_13} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 129#[$Ultimate##0, L68, $Ultimate##0, L81]true [2023-10-12 17:37:09,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 159973, now seen corresponding path program 1 times [2023-10-12 17:37:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981990987] [2023-10-12 17:37:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash 4745, now seen corresponding path program 1 times [2023-10-12 17:37:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120968448] [2023-10-12 17:37:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 153737837, now seen corresponding path program 1 times [2023-10-12 17:37:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983401107] [2023-10-12 17:37:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,985 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:09 BoogieIcfgContainer [2023-10-12 17:37:09,985 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:09,986 INFO L158 Benchmark]: Toolchain (without parser) took 2963.95ms. Allocated memory was 174.1MB in the beginning and 278.9MB in the end (delta: 104.9MB). Free memory was 122.7MB in the beginning and 200.1MB in the end (delta: -77.4MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,987 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 174.1MB. Free memory was 123.9MB in the beginning and 123.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:09,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.01ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,989 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 174.1MB. Free memory was 121.1MB in the beginning and 119.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,989 INFO L158 Benchmark]: RCFGBuilder took 318.19ms. Allocated memory is still 174.1MB. Free memory was 119.9MB in the beginning and 109.7MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,991 INFO L158 Benchmark]: BuchiAutomizer took 2603.40ms. Allocated memory was 174.1MB in the beginning and 278.9MB in the end (delta: 104.9MB). Free memory was 109.6MB in the beginning and 200.1MB in the end (delta: -90.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26ms. Allocated memory is still 174.1MB. Free memory was 123.9MB in the beginning and 123.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.01ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 174.1MB. Free memory was 121.1MB in the beginning and 119.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 318.19ms. Allocated memory is still 174.1MB. Free memory was 119.9MB in the beginning and 109.7MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2603.40ms. Allocated memory was 174.1MB in the beginning and 278.9MB in the end (delta: 104.9MB). Free memory was 109.6MB in the beginning and 200.1MB in the end (delta: -90.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 3 locations. The remainder module has 2496 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 136 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp329 ukn20 mio100 lsp82 div100 bol100 ite100 ukn100 eq159 hnf97 smp100 dnf421 smp29 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 119ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 68]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 68]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 31 PlacesAfterwards, 39 TransitionsBefore, 22 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 878 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 732, independent: 718, independent conditional: 0, independent unconditional: 718, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 461, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 461, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 732, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 461, unknown conditional: 0, unknown unconditional: 461] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:37:10,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:10,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...