/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-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:06,344 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:06,405 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,432 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:06,432 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:06,433 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:06,433 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:06,434 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:06,434 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:06,437 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:06,437 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:06,437 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:06,437 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:06,438 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:06,438 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:06,438 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:06,439 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:06,439 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:06,439 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:06,439 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:06,439 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:06,440 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:06,441 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:06,442 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:06,442 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:06,443 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:06,443 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:06,444 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:06,444 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,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:06,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:06,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:06,695 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:06,696 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:06,697 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-2.bpl [2023-10-12 17:37:06,697 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl' [2023-10-12 17:37:06,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:06,714 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:06,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:06,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:06,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:06,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,734 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:06,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:06,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:06,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:06,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:06,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:06,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:06,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:06,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:06,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/1) ... [2023-10-12 17:37:06,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,787 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:06,798 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:06,816 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:37:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:37:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:37:06,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:06,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:06,817 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:06,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:37:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:37:06,818 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:37:06,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:37:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:37:06,818 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:37:06,819 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:06,854 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:06,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:06,989 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:06,994 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:06,994 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:06,995 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:06 BoogieIcfgContainer [2023-10-12 17:37:06,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:06,996 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:06,996 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:07,001 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:07,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:07,002 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:06" (1/2) ... [2023-10-12 17:37:07,003 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d958ddf and model type min-max-sample-abs-2.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,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:07,003 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:06" (2/2) ... [2023-10-12 17:37:07,005 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-2.bpl [2023-10-12 17:37:07,106 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:37:07,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 120 flow [2023-10-12 17:37:07,158 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:37:07,159 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:07,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:37:07,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 120 flow [2023-10-12 17:37:07,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2023-10-12 17:37:07,173 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:07,193 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 96 flow [2023-10-12 17:37:07,197 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 96 flow [2023-10-12 17:37:07,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 96 flow [2023-10-12 17:37:07,210 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:37:07,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:07,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:37:07,211 INFO L119 LiptonReduction]: Number of co-enabled transitions 570 [2023-10-12 17:37:07,545 INFO L134 LiptonReduction]: Checked pairs total: 534 [2023-10-12 17:37:07,545 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:37:07,554 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:07,554 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:07,554 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:07,554 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:07,554 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:07,554 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:07,554 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:07,555 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:07,555 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:37:07,557 ERROR L47 etriNetUnfolderRabin]: [1:1A:[82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[][9], 2:2A:[113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][1], 4:3A:[136] $Ultimate##0-->L34-1: Formula: (and (= (select v_A_29 0) v_array_min_15) (= v_computeMinThread1of1ForFork0_i1_19 0)) InVars {A=v_A_29} OutVars{A=v_A_29, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_19, array_min=v_array_min_15} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][13]][5:4A:[139] L34-1-->L34-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_32 v_N_40) (= (let ((.cse0 (let ((.cse1 (select v_A_63 v_computeMinThread1of1ForFork0_i1_32))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_36 .cse0) v_array_min_36 .cse0)) v_array_min_35) (= v_computeMinThread1of1ForFork0_i1_31 (+ v_computeMinThread1of1ForFork0_i1_32 1))) InVars {A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_32, array_min=v_array_min_36, N=v_N_40} OutVars{A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_31, array_min=v_array_min_35, N=v_N_40} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][22]] [2023-10-12 17:37:07,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:07,559 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:07,559 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:07,559 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:07,560 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:07,561 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:37:07,562 ERROR L47 etriNetUnfolderRabin]: [1:1A:[82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[][9], 2:2A:[113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][1], 4:3A:[136] $Ultimate##0-->L34-1: Formula: (and (= (select v_A_29 0) v_array_min_15) (= v_computeMinThread1of1ForFork0_i1_19 0)) InVars {A=v_A_29} OutVars{A=v_A_29, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_19, array_min=v_array_min_15} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][13]][5:4A:[139] L34-1-->L34-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_32 v_N_40) (= (let ((.cse0 (let ((.cse1 (select v_A_63 v_computeMinThread1of1ForFork0_i1_32))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_36 .cse0) v_array_min_36 .cse0)) v_array_min_35) (= v_computeMinThread1of1ForFork0_i1_31 (+ v_computeMinThread1of1ForFork0_i1_32 1))) InVars {A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_32, array_min=v_array_min_36, N=v_N_40} OutVars{A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_31, array_min=v_array_min_35, N=v_N_40} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min][22]] [2023-10-12 17:37:07,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:07,562 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:07,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:07,562 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:07,565 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 55#[L85]true [113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 57#[L85-1, $Ultimate##0]true [136] $Ultimate##0-->L34-1: Formula: (and (= (select v_A_29 0) v_array_min_15) (= v_computeMinThread1of1ForFork0_i1_19 0)) InVars {A=v_A_29} OutVars{A=v_A_29, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_19, array_min=v_array_min_15} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 59#[L85-1, L34-1]true [2023-10-12 17:37:07,565 INFO L750 eck$LassoCheckResult]: Loop: 59#[L85-1, L34-1]true [139] L34-1-->L34-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_32 v_N_40) (= (let ((.cse0 (let ((.cse1 (select v_A_63 v_computeMinThread1of1ForFork0_i1_32))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_36 .cse0) v_array_min_36 .cse0)) v_array_min_35) (= v_computeMinThread1of1ForFork0_i1_31 (+ v_computeMinThread1of1ForFork0_i1_32 1))) InVars {A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_32, array_min=v_array_min_36, N=v_N_40} OutVars{A=v_A_63, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_31, array_min=v_array_min_35, N=v_N_40} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 59#[L85-1, L34-1]true [2023-10-12 17:37:07,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 112232, now seen corresponding path program 1 times [2023-10-12 17:37:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76787356] [2023-10-12 17:37:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:07,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 1 times [2023-10-12 17:37:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499218343] [2023-10-12 17:37:07,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:07,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash 3479331, now seen corresponding path program 1 times [2023-10-12 17:37:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259197550] [2023-10-12 17:37:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:07,912 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:07,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:07,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:07,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:07,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:07,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:07,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:07,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:07,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:07,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:07,930 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:07,953 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,239 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:08,241 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,265 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,266 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,268 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,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,316 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,319 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,320 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,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,327 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:37:08,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,358 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:37:08,358 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:37:08,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,402 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,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,404 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,406 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,416 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,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:08,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:08,469 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:08,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,473 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,474 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,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:08,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:08,498 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:08,498 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,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:08,515 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:08,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,577 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,578 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,610 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:08,696 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:08,700 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:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-10-12 17:37:08,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:08,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:08,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:08,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,710 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 92 transitions, 464 flow [2023-10-12 17:37:08,713 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:08,713 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 92 transitions, 464 flow [2023-10-12 17:37:08,718 ERROR L47 etriNetUnfolderRabin]: [1:1A:[82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[][36], 2:2A:[113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][4], 3:3A:[116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][12], 9:4A:[127] $Ultimate##0-->L48-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_15 0) (= (select v_A_11 0) v_array_max_10)) InVars {A=v_A_11} OutVars{A=v_A_11, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_15, array_max=v_array_max_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max][64]][11:5A:[137] L48-1-->L48-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_25 (+ v_computeMaxThread1of1ForFork1_i2_26 1)) (= (let ((.cse0 (let ((.cse1 (select v_A_39 v_computeMaxThread1of1ForFork1_i2_26))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_32 .cse0) .cse0 v_array_max_32)) v_array_max_31) (< v_computeMaxThread1of1ForFork1_i2_26 v_N_26)) InVars {A=v_A_39, N=v_N_26, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_26, array_max=v_array_max_32} OutVars{A=v_A_39, N=v_N_26, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_25, array_max=v_array_max_31} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max][84]] [2023-10-12 17:37:08,719 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:08,719 INFO L124 PetriNetUnfolderBase]: 3/10 cut-off events. [2023-10-12 17:37:08,719 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:08,719 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:08,719 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 55#[L85]true [113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 57#[L85-1, $Ultimate##0]true [116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 99#[L86, $Ultimate##0, $Ultimate##0]true [127] $Ultimate##0-->L48-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_15 0) (= (select v_A_11 0) v_array_max_10)) InVars {A=v_A_11} OutVars{A=v_A_11, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_15, array_max=v_array_max_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 101#[L86, $Ultimate##0, L48-1]true [2023-10-12 17:37:08,719 INFO L750 eck$LassoCheckResult]: Loop: 101#[L86, $Ultimate##0, L48-1]true [137] L48-1-->L48-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_25 (+ v_computeMaxThread1of1ForFork1_i2_26 1)) (= (let ((.cse0 (let ((.cse1 (select v_A_39 v_computeMaxThread1of1ForFork1_i2_26))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_32 .cse0) .cse0 v_array_max_32)) v_array_max_31) (< v_computeMaxThread1of1ForFork1_i2_26 v_N_26)) InVars {A=v_A_39, N=v_N_26, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_26, array_max=v_array_max_32} OutVars{A=v_A_39, N=v_N_26, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_25, array_max=v_array_max_31} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 101#[L86, $Ultimate##0, L48-1]true [2023-10-12 17:37:08,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 3478699, now seen corresponding path program 1 times [2023-10-12 17:37:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658467508] [2023-10-12 17:37:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:37:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588181252] [2023-10-12 17:37:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash 107839806, now seen corresponding path program 1 times [2023-10-12 17:37:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151433357] [2023-10-12 17:37:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:08,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,909 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:08,909 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:08,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:08,909 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:08,909 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:08,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:08,909 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:08,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:08,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:08,910 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:08,912 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,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:08,998 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,000 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,003 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,185 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:09,185 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:09,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,191 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,192 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,233 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,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:09,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:09,241 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:37:09,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:09,254 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:37:09,254 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:37:09,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:09,305 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 [2023-10-12 17:37:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,307 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,312 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,313 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,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:09,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:09,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:09,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:09,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:09,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:09,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:09,357 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:09,357 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:09,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:09,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:09,370 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,371 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,373 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:09,393 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:09,394 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:09,394 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2023-10-12 17:37:09,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:37:09,414 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:09,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:09,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:09,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:09,438 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:09,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:09,438 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,439 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,510 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,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-10-12 17:37:09,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:09,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:09,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:09,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:09,512 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 368 transitions, 2592 flow [2023-10-12 17:37:09,512 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:09,512 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 368 transitions, 2592 flow [2023-10-12 17:37:09,517 ERROR L47 etriNetUnfolderRabin]: [1:1A:[82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[][144], 2:2A:[113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0][16], 3:3A:[116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][48], 6:4A:[119] L86-->L70: 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][0]][21:5A:[95] L70-->L72: 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][176], 23:6A:[133] L72-->L70: Formula: (and (= v_array_max_21 v_sampleThread1of1ForFork2_max_l_11) (= (+ v_sampleThread1of1ForFork2_diff_5 v_sampleThread1of1ForFork2_min_l_7) v_sampleThread1of1ForFork2_max_l_11)) InVars {array_max=v_array_max_21, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_21, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_11} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l][304]] [2023-10-12 17:37:09,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:09,517 INFO L124 PetriNetUnfolderBase]: 10/22 cut-off events. [2023-10-12 17:37:09,517 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:37:09,517 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:09,518 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [82] $Ultimate##0-->L85: Formula: (and (<= 0 v_ULTIMATE.start_m_3) (< v_ULTIMATE.start_m_3 v_N_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_3} AuxVars[] AssignedVars[] 55#[L85]true [113] L85-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 57#[L85-1, $Ultimate##0]true [116] L85-1-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 99#[L86, $Ultimate##0, $Ultimate##0]true [119] L86-->L70: 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] 139#[$Ultimate##0, $Ultimate##0, L87, L70]true [2023-10-12 17:37:09,518 INFO L750 eck$LassoCheckResult]: Loop: 139#[$Ultimate##0, $Ultimate##0, L87, L70]true [95] L70-->L72: 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] 142#[$Ultimate##0, L87, $Ultimate##0, L72]true [133] L72-->L70: Formula: (and (= v_array_max_21 v_sampleThread1of1ForFork2_max_l_11) (= (+ v_sampleThread1of1ForFork2_diff_5 v_sampleThread1of1ForFork2_min_l_7) v_sampleThread1of1ForFork2_max_l_11)) InVars {array_max=v_array_max_21, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_21, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_11} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 139#[$Ultimate##0, $Ultimate##0, L87, L70]true [2023-10-12 17:37:09,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 3478691, now seen corresponding path program 1 times [2023-10-12 17:37:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288587795] [2023-10-12 17:37:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash 4039, now seen corresponding path program 1 times [2023-10-12 17:37:09,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090751312] [2023-10-12 17:37:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -951942167, now seen corresponding path program 1 times [2023-10-12 17:37:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144061900] [2023-10-12 17:37:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:09,640 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:09 BoogieIcfgContainer [2023-10-12 17:37:09,640 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:09,641 INFO L158 Benchmark]: Toolchain (without parser) took 2926.36ms. Allocated memory was 184.5MB in the beginning and 335.5MB in the end (delta: 151.0MB). Free memory was 129.6MB in the beginning and 151.1MB in the end (delta: -21.5MB). Peak memory consumption was 130.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,641 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 130.7MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:09,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.95ms. Allocated memory is still 184.5MB. Free memory was 129.6MB in the beginning and 128.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,644 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 126.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,644 INFO L158 Benchmark]: RCFGBuilder took 236.62ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 116.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,646 INFO L158 Benchmark]: BuchiAutomizer took 2644.08ms. Allocated memory was 184.5MB in the beginning and 335.5MB in the end (delta: 151.0MB). Free memory was 116.4MB in the beginning and 151.1MB in the end (delta: -34.8MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,651 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.24ms. Allocated memory is still 184.5MB. Free memory was 130.8MB in the beginning and 130.7MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.95ms. Allocated memory is still 184.5MB. Free memory was 129.6MB in the beginning and 128.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 126.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.62ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 116.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2644.08ms. Allocated memory was 184.5MB in the beginning and 335.5MB in the end (delta: 151.0MB). Free memory was 116.4MB in the beginning and 151.1MB in the end (delta: -34.8MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) 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 2592 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. Construction of modules took 0.0s. 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, 218 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 126 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp557 ukn13 mio100 lsp75 div100 bol100 ite100 ukn100 eq156 hnf97 smp100 dnf437 smp24 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 91ms 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: 70]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 70]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L83] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L85] FORK 0 fork 1 computeMin(); VAL [N=1, m=0] [L86] FORK 0 fork 2, 2 computeMax(); VAL [N=1, m=0] [L87] FORK 0 fork 3, 3, 3 sample(); VAL [N=1, m=0] Loop: [L71] min_l := array_min; [L72] max_l := array_max; [L74] 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.3s, 45 PlacesBefore, 32 PlacesAfterwards, 36 TransitionsBefore, 23 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 534 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 433, independent: 423, independent conditional: 0, independent unconditional: 423, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 316, independent: 307, independent conditional: 0, independent unconditional: 307, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 316, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 433, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 316, unknown conditional: 0, unknown unconditional: 316] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, 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:09,671 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,875 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:10,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...