/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 BUCHI_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:19:04,723 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:19:04,781 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:19:04,808 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:19:04,809 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:19:04,809 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:19:04,810 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:19:04,810 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:19:04,810 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:19:04,810 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:19:04,811 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:19:04,811 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:19:04,811 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:19:04,811 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:19:04,811 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:19:04,812 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:19:04,812 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:19:04,812 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:19:04,812 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:19:04,813 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:19:04,813 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:19:04,815 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:19:04,816 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:19:04,817 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:19:04,817 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:19:04,817 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:19:04,817 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:19:04,817 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:19:04,818 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:19:04,818 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 -> BUCHI_PETRI_NET [2023-10-12 17:19:04,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:19:04,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:19:05,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:19:05,002 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:19:05,003 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:19:05,004 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:19:05,005 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:19:05,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:19:05,037 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:19:05,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:05,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:19:05,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:19:05,049 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:19:05" (1/1) ... [2023-10-12 17:19:05,058 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:19:05" (1/1) ... [2023-10-12 17:19:05,063 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:19:05,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:05,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:19:05,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:19:05,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:19:05,070 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:19:05" (1/1) ... [2023-10-12 17:19:05,071 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:19:05" (1/1) ... [2023-10-12 17:19:05,071 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:19:05" (1/1) ... [2023-10-12 17:19:05,071 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:19:05" (1/1) ... [2023-10-12 17:19:05,073 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:19:05" (1/1) ... [2023-10-12 17:19:05,076 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:19:05" (1/1) ... [2023-10-12 17:19:05,077 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:19:05" (1/1) ... [2023-10-12 17:19:05,078 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:19:05" (1/1) ... [2023-10-12 17:19:05,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:19:05,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:19:05,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:19:05,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:19:05,089 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:19:05" (1/1) ... [2023-10-12 17:19:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:05,127 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:19:05,152 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:19:05,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:19:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:19:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:19:05,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:19:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:19:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:19:05,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:19:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:19:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:19:05,163 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:19:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:19:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:19:05,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:19:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:19:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:19:05,165 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:19:05,204 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:19:05,206 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:19:05,306 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:19:05,311 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:19:05,311 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:19:05,312 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:05 BoogieIcfgContainer [2023-10-12 17:19:05,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:19:05,313 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:19:05,313 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:19:05,318 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:19:05,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:05,318 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:19:05" (1/2) ... [2023-10-12 17:19:05,319 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34b742a7 and model type min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:19:05, skipping insertion in model container [2023-10-12 17:19:05,319 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:05,320 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:19:05" (2/2) ... [2023-10-12 17:19:05,321 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-2.bpl [2023-10-12 17:19:05,421 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:19:05,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 120 flow [2023-10-12 17:19:05,475 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:19:05,475 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:19:05,479 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:19:05,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 120 flow [2023-10-12 17:19:05,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2023-10-12 17:19:05,484 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:19:05,494 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 96 flow [2023-10-12 17:19:05,496 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 96 flow [2023-10-12 17:19:05,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 96 flow [2023-10-12 17:19:05,506 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:19:05,506 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:19:05,507 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:19:05,508 INFO L119 LiptonReduction]: Number of co-enabled transitions 570 [2023-10-12 17:19:05,829 INFO L134 LiptonReduction]: Checked pairs total: 534 [2023-10-12 17:19:05,829 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:19:05,840 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:19:05,840 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:19:05,840 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:19:05,840 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:19:05,840 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:19:05,841 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:19:05,841 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:19:05,842 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:19:05,844 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:19:05,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:05,849 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:19:05,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:05,849 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:05,853 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:19:05,853 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:19:05,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:05,858 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:19:05,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:05,858 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:05,863 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:19:05,864 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:19:05,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 112232, now seen corresponding path program 1 times [2023-10-12 17:19:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:05,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976288074] [2023-10-12 17:19:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:05,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:05,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:06,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:06,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 1 times [2023-10-12 17:19:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798014454] [2023-10-12 17:19:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:06,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:06,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:06,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash 3479331, now seen corresponding path program 1 times [2023-10-12 17:19:06,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482454843] [2023-10-12 17:19:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:06,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:06,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:06,205 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:06,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:06,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:06,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:06,206 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:06,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:06,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:06,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:06,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:19:06,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:06,207 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:06,229 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:19:06,239 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:19:06,508 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:06,511 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:06,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:06,523 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:19:06,524 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:19:06,525 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:19:06,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:06,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:06,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:06,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:06,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:06,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:06,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:06,562 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:19:06,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:06,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:06,565 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:19:06,566 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:19:06,567 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:19:06,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:06,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:06,573 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:19:06,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:06,614 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:19:06,614 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:19:06,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:06,666 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:19:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:06,674 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:19:06,677 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:19:06,678 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:19:06,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:06,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:06,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:06,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:06,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:06,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:06,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:06,724 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:19:06,724 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:19:06,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:06,728 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:19:06,729 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:19:06,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:06,798 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:06,799 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:06,799 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2023-10-12 17:19:06,802 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:19:06,804 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:06,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:06,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:06,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:06,853 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:06,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:06,854 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:19:06,887 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:19:06,905 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:19:06,906 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:19:07,013 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 5 states and 334 transitions. [2023-10-12 17:19:07,014 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:07,017 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:07,019 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:19:07,028 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:19:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-10-12 17:19:07,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:19:07,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:07,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:19:07,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:07,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:19:07,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:07,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:19:07,182 INFO L124 PetriNetUnfolderBase]: 1712/2222 cut-off events. [2023-10-12 17:19:07,183 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-10-12 17:19:07,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 2222 events. 1712/2222 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7510 event pairs, 167 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 3860. Up to 708 conditions per place. [2023-10-12 17:19:07,187 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:19:07,191 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 264 transitions, 1332 flow [2023-10-12 17:19:07,191 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 264 transitions, 1332 flow [2023-10-12 17:19:07,191 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:19:07,191 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:19:07,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:07,194 INFO L124 PetriNetUnfolderBase]: 12/29 cut-off events. [2023-10-12 17:19:07,194 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:19:07,194 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:07,195 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] 108#[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] 110#[$Ultimate##0, L87, $Ultimate##0, L70]true [2023-10-12 17:19:07,195 INFO L750 eck$LassoCheckResult]: Loop: 110#[$Ultimate##0, L87, $Ultimate##0, 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] 113#[$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] 110#[$Ultimate##0, L87, $Ultimate##0, L70]true [2023-10-12 17:19:07,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 3478691, now seen corresponding path program 1 times [2023-10-12 17:19:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043860591] [2023-10-12 17:19:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:07,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 4039, now seen corresponding path program 1 times [2023-10-12 17:19:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539610144] [2023-10-12 17:19:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:07,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash -951942167, now seen corresponding path program 1 times [2023-10-12 17:19:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295283979] [2023-10-12 17:19:07,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:07,332 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:07 BoogieIcfgContainer [2023-10-12 17:19:07,332 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:07,333 INFO L158 Benchmark]: Toolchain (without parser) took 2294.79ms. Allocated memory was 233.8MB in the beginning and 366.0MB in the end (delta: 132.1MB). Free memory was 184.7MB in the beginning and 257.8MB in the end (delta: -73.1MB). Peak memory consumption was 60.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,333 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.55ms. Allocated memory is still 233.8MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:07,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.39ms. Allocated memory is still 233.8MB. Free memory was 184.5MB in the beginning and 183.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,334 INFO L158 Benchmark]: Boogie Preprocessor took 20.83ms. Allocated memory is still 233.8MB. Free memory was 183.0MB in the beginning and 181.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,334 INFO L158 Benchmark]: RCFGBuilder took 224.90ms. Allocated memory is still 233.8MB. Free memory was 181.8MB in the beginning and 171.6MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,334 INFO L158 Benchmark]: BuchiAutomizer took 2018.81ms. Allocated memory was 233.8MB in the beginning and 366.0MB in the end (delta: 132.1MB). Free memory was 171.5MB in the beginning and 257.8MB in the end (delta: -86.3MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,336 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.55ms. Allocated memory is still 233.8MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.39ms. Allocated memory is still 233.8MB. Free memory was 184.5MB in the beginning and 183.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.83ms. Allocated memory is still 233.8MB. Free memory was 183.0MB in the beginning and 181.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.90ms. Allocated memory is still 233.8MB. Free memory was 181.8MB in the beginning and 171.6MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2018.81ms. Allocated memory was 233.8MB in the beginning and 366.0MB in the end (delta: 132.1MB). Free memory was 171.5MB in the beginning and 257.8MB in the end (delta: -86.3MB). Peak memory consumption was 47.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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. The remainder module has 1332 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 63 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp576 ukn15 mio100 lsp78 div100 bol100 ite100 ukn100 eq163 hnf98 smp100 dnf192 smp35 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 98ms 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: 53, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 25, dependent conditional: 0, dependent unconditional: 25, 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:19:07,352 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...