/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/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:05:37,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:05:37,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:05:37,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:05:37,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:05:37,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:05:37,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:05:37,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:05:37,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:05:37,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:05:37,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:05:37,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:05:37,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:05:37,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:05:37,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:05:37,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:05:37,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:05:37,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:05:37,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:05:37,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:05:37,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:05:37,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:05:37,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:05:37,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:05:37,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:05:37,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:05:37,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:05:37,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:05:37,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:05:37,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:05:37,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:05:37,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:05:37,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:05:37,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:05:37,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:05:37,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:05:37,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:05:37,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:05:37,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:05:37,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:05:37,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:05:37,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf [2022-09-29 15:05:37,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:05:37,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:05:37,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:05:37,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:05:37,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:05:37,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:05:37,232 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:05:37,232 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:05:37,232 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:05:37,232 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:05:37,233 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:05:37,233 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:05:37,233 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:05:37,233 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 15:05:37,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:05:37,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:05:37,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:05:37,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:05:37,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:05:37,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:05:37,237 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:05:37,237 INFO L138 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 [2022-09-29 15:05:37,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:05:37,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:05:37,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:05:37,487 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:05:37,489 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:05:37,490 INFO L432 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 [2022-09-29 15:05:37,491 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-2.bpl' [2022-09-29 15:05:37,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:05:37,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:05:37,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:05:37,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:05:37,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:05:37,523 INFO L185 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 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,530 INFO L185 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 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,535 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:05:37,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:05:37,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:05:37,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:05:37,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:05:37,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:05:37,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:05:37,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:05:37,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:05:37,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/1) ... [2022-09-29 15:05:37,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:37,579 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) [2022-09-29 15:05:37,606 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 [2022-09-29 15:05:37,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2022-09-29 15:05:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2022-09-29 15:05:37,624 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2022-09-29 15:05:37,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:05:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:05:37,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:05:37,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2022-09-29 15:05:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2022-09-29 15:05:37,626 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2022-09-29 15:05:37,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2022-09-29 15:05:37,626 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2022-09-29 15:05:37,627 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2022-09-29 15:05:37,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2022-09-29 15:05:37,627 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2022-09-29 15:05:37,627 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2022-09-29 15:05:37,629 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:05:37,676 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:05:37,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:05:37,824 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:05:37,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:05:37,830 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 15:05:37,832 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:05:37 BoogieIcfgContainer [2022-09-29 15:05:37,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:05:37,833 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:05:37,833 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:05:37,838 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:05:37,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:05:37,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:37" (1/2) ... [2022-09-29 15:05:37,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@642a9838 and model type min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:05:37, skipping insertion in model container [2022-09-29 15:05:37,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:05:37,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:05:37" (2/2) ... [2022-09-29 15:05:37,844 INFO L322 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-2.bpl [2022-09-29 15:05:37,972 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-09-29 15:05:38,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 120 flow [2022-09-29 15:05:38,065 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:05:38,066 INFO L123 PetriNetUnfolderBase]: 4/36 cut-off events. [2022-09-29 15:05:38,066 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:05:38,069 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 84 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. [2022-09-29 15:05:38,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 44 transitions, 120 flow [2022-09-29 15:05:38,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 96 flow [2022-09-29 15:05:38,083 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:05:38,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 96 flow [2022-09-29 15:05:38,110 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 96 flow [2022-09-29 15:05:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 96 flow [2022-09-29 15:05:38,129 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:05:38,129 INFO L123 PetriNetUnfolderBase]: 4/36 cut-off events. [2022-09-29 15:05:38,129 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:05:38,130 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 7. 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. [2022-09-29 15:05:38,131 INFO L116 LiptonReduction]: Number of co-enabled transitions 570 [2022-09-29 15:05:38,513 INFO L131 LiptonReduction]: Checked pairs total: 526 [2022-09-29 15:05:38,513 INFO L133 LiptonReduction]: Total number of compositions: 13 [2022-09-29 15:05:38,528 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:05:38,528 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:05:38,528 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:05:38,528 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:05:38,528 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:05:38,528 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:05:38,528 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:05:38,528 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 15:05:38,529 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 32 places, 23 transitions, 70 flow [2022-09-29 15:05:38,533 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 32 places, 23 transitions, 70 flow [2022-09-29 15:05:38,535 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:38,535 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:38,535 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:05:38,535 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:05:38,536 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:38,539 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:05:38,539 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 32 places, 23 transitions, 70 flow [2022-09-29 15:05:38,540 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 32 places, 23 transitions, 70 flow [2022-09-29 15:05:38,540 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:38,540 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:38,540 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:05:38,540 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:05:38,541 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:38,545 INFO L733 eck$LassoCheckResult]: Stem: 53#[ULTIMATE.startENTRY]true [68] ULTIMATE.startENTRY-->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-->computeMinENTRY: 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, computeMinENTRY]true [136] computeMinENTRY-->L34-1: Formula: (and (= (select v_A_37 0) v_array_min_23) (= v_computeMinThread1of1ForFork0_i1_25 0)) InVars {A=v_A_37} OutVars{A=v_A_37, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_25, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 59#[L34-1, L85-1]true [2022-09-29 15:05:38,545 INFO L735 eck$LassoCheckResult]: Loop: 59#[L34-1, L85-1]true [139] L34-1-->L34-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_32 v_N_24) (= v_computeMinThread1of1ForFork0_i1_31 (+ v_computeMinThread1of1ForFork0_i1_32 1)) (= (let ((.cse0 (let ((.cse1 (select v_A_57 v_computeMinThread1of1ForFork0_i1_32))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_30 .cse0) v_array_min_30 .cse0)) v_array_min_29)) InVars {A=v_A_57, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_32, array_min=v_array_min_30, N=v_N_24} OutVars{A=v_A_57, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_31, array_min=v_array_min_29, N=v_N_24} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 59#[L34-1, L85-1]true [2022-09-29 15:05:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 98778, now seen corresponding path program 1 times [2022-09-29 15:05:38,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:38,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130150614] [2022-09-29 15:05:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 1 times [2022-09-29 15:05:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999821093] [2022-09-29 15:05:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 3062257, now seen corresponding path program 1 times [2022-09-29 15:05:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463289960] [2022-09-29 15:05:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:38,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:38,877 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:05:38,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:05:38,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:05:38,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:05:38,891 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:05:38,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:38,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:05:38,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:05:38,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-2.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:05:38,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:05:38,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:05:38,931 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:38,942 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:39,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:05:39,236 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:05:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:39,257 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) [2022-09-29 15:05:39,260 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 [2022-09-29 15:05:39,260 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 [2022-09-29 15:05:39,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:39,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:39,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:39,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:39,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:39,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:39,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:05:39,292 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 [2022-09-29 15:05:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:39,294 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) [2022-09-29 15:05:39,295 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 [2022-09-29 15:05:39,302 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 [2022-09-29 15:05:39,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:39,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:39,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:39,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:39,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:39,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:39,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:05:39,346 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:05:39,346 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-09-29 15:05:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:39,349 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) [2022-09-29 15:05:39,367 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 [2022-09-29 15:05:39,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:05:39,398 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:05:39,398 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:05:39,399 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2022-09-29 15:05:39,431 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 [2022-09-29 15:05:39,434 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:05:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:39,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:05:39,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:39,487 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:05:39,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:05:39,525 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 [2022-09-29 15:05:39,528 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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) [2022-09-29 15:05:39,707 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 6 states and 499 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:05:39,708 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:05:39,712 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:05:39,722 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 [2022-09-29 15:05:39,727 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) [2022-09-29 15:05:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-09-29 15:05:39,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:05:39,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:39,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:05:39,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:39,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:05:39,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:39,739 INFO L428 stractBuchiCegarLoop]: Abstraction has has 44 places, 392 transitions, 1982 flow [2022-09-29 15:05:39,739 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:05:39,739 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 44 places, 392 transitions, 1982 flow [2022-09-29 15:05:39,743 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 44 places, 392 transitions, 1982 flow [2022-09-29 15:05:39,745 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:39,752 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 44 places, 392 transitions, 1982 flow [2022-09-29 15:05:39,754 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:39,760 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 44 places, 392 transitions, 1982 flow [2022-09-29 15:05:39,763 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:39,763 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:39,763 INFO L123 PetriNetUnfolderBase]: 20/38 cut-off events. [2022-09-29 15:05:39,763 INFO L124 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2022-09-29 15:05:39,763 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:39,764 INFO L733 eck$LassoCheckResult]: Stem: 53#[ULTIMATE.startENTRY]true [68] ULTIMATE.startENTRY-->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-->computeMinENTRY: 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, computeMinENTRY]true [116] L85-1-->computeMaxENTRY: 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] 110#[L86, computeMaxENTRY, computeMinENTRY]true [134] computeMaxENTRY-->L48-1: Formula: (and (= v_array_max_25 (select v_A_23 0)) (= v_computeMaxThread1of1ForFork1_i2_23 0)) InVars {A=v_A_23} OutVars{A=v_A_23, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_23, array_max=v_array_max_25} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 112#[L86, L48-1, computeMinENTRY]true [2022-09-29 15:05:39,764 INFO L735 eck$LassoCheckResult]: Loop: 112#[L86, L48-1, computeMinENTRY]true [138] L48-1-->L48-1: Formula: (and (= (let ((.cse0 (let ((.cse1 (select v_A_51 v_computeMaxThread1of1ForFork1_i2_32))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_34 .cse0) .cse0 v_array_max_34)) v_array_max_33) (= (+ v_computeMaxThread1of1ForFork1_i2_32 1) v_computeMaxThread1of1ForFork1_i2_31) (< v_computeMaxThread1of1ForFork1_i2_32 v_N_22)) InVars {A=v_A_51, N=v_N_22, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_32, array_max=v_array_max_34} OutVars{A=v_A_51, N=v_N_22, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_31, array_max=v_array_max_33} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 112#[L86, L48-1, computeMinENTRY]true [2022-09-29 15:05:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 3061632, now seen corresponding path program 1 times [2022-09-29 15:05:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:39,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747063210] [2022-09-29 15:05:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 169, now seen corresponding path program 1 times [2022-09-29 15:05:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:39,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649297782] [2022-09-29 15:05:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 94910730, now seen corresponding path program 1 times [2022-09-29 15:05:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:39,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365204499] [2022-09-29 15:05:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:39,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,046 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:05:40,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:05:40,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:05:40,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:05:40,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:05:40,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:05:40,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:05:40,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-2.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:05:40,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:05:40,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:05:40,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:40,122 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:40,124 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:40,127 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:40,130 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:05:40,286 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:05:40,286 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:05:40,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,292 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) [2022-09-29 15:05:40,294 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 [2022-09-29 15:05:40,295 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 [2022-09-29 15:05:40,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:40,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:40,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:40,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:40,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:40,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:40,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:05:40,341 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:05:40,341 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-09-29 15:05:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,380 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) [2022-09-29 15:05:40,382 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 [2022-09-29 15:05:40,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:05:40,391 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:05:40,392 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:05:40,392 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2022-09-29 15:05:40,419 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 [2022-09-29 15:05:40,421 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:05:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:40,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:05:40,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:40,448 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:05:40,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:05:40,450 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 [2022-09-29 15:05:40,450 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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) [2022-09-29 15:05:40,522 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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) Result 6 states and 499 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:05:40,522 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:05:40,566 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:05:40,567 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 [2022-09-29 15:05:40,568 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) [2022-09-29 15:05:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-09-29 15:05:40,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:05:40,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:40,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:05:40,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:40,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 15:05:40,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:40,569 INFO L428 stractBuchiCegarLoop]: Abstraction has has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,570 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:05:40,570 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,592 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,601 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,603 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,612 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,627 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,645 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,652 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,670 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,672 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,690 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,704 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 56 places, 6660 transitions, 47088 flow [2022-09-29 15:05:40,781 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,781 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:40,781 INFO L123 PetriNetUnfolderBase]: 85/128 cut-off events. [2022-09-29 15:05:40,781 INFO L124 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2022-09-29 15:05:40,781 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:40,783 INFO L733 eck$LassoCheckResult]: Stem: 53#[ULTIMATE.startENTRY]true [68] ULTIMATE.startENTRY-->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-->computeMinENTRY: 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, computeMinENTRY]true [116] L85-1-->computeMaxENTRY: 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] 110#[L86, computeMaxENTRY, computeMinENTRY]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] 161#[computeMaxENTRY, L87, computeMinENTRY, L70]true [2022-09-29 15:05:40,783 INFO L735 eck$LassoCheckResult]: Loop: 161#[computeMaxENTRY, L87, computeMinENTRY, L70]true [94] 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] 164#[computeMaxENTRY, L87, computeMinENTRY, L72]true [133] L72-->L70: Formula: (and (= v_array_max_20 v_sampleThread1of1ForFork2_max_l_11) (= v_sampleThread1of1ForFork2_diff_5 (+ (* (- 1) v_sampleThread1of1ForFork2_min_l_7) v_sampleThread1of1ForFork2_max_l_11))) InVars {array_max=v_array_max_20, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_20, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_7, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_11} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 161#[computeMaxENTRY, L87, computeMinENTRY, L70]true [2022-09-29 15:05:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash 3061617, now seen corresponding path program 1 times [2022-09-29 15:05:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410496329] [2022-09-29 15:05:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash 4008, now seen corresponding path program 1 times [2022-09-29 15:05:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673110988] [2022-09-29 15:05:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1352750312, now seen corresponding path program 1 times [2022-09-29 15:05:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523141826] [2022-09-29 15:05:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,895 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:05:40 BoogieIcfgContainer [2022-09-29 15:05:40,895 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:05:40,896 INFO L158 Benchmark]: Toolchain (without parser) took 3383.96ms. Allocated memory was 177.2MB in the beginning and 249.6MB in the end (delta: 72.4MB). Free memory was 137.5MB in the beginning and 97.6MB in the end (delta: 39.9MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. [2022-09-29 15:05:40,896 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:05:40,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.67ms. Allocated memory is still 177.2MB. Free memory was 137.4MB in the beginning and 135.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:05:40,897 INFO L158 Benchmark]: Boogie Preprocessor took 16.98ms. Allocated memory is still 177.2MB. Free memory was 135.8MB in the beginning and 134.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:05:40,898 INFO L158 Benchmark]: RCFGBuilder took 277.10ms. Allocated memory is still 177.2MB. Free memory was 134.7MB in the beginning and 125.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-09-29 15:05:40,898 INFO L158 Benchmark]: BuchiAutomizer took 3062.44ms. Allocated memory was 177.2MB in the beginning and 249.6MB in the end (delta: 72.4MB). Free memory was 125.1MB in the beginning and 97.6MB in the end (delta: 27.5MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. [2022-09-29 15:05:40,900 INFO L339 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.10ms. Allocated memory is still 177.2MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.67ms. Allocated memory is still 177.2MB. Free memory was 137.4MB in the beginning and 135.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.98ms. Allocated memory is still 177.2MB. Free memory was 135.8MB in the beginning and 134.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 277.10ms. Allocated memory is still 177.2MB. Free memory was 134.7MB in the beginning and 125.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3062.44ms. Allocated memory was 177.2MB in the beginning and 249.6MB in the end (delta: 72.4MB). Free memory was 125.1MB in the beginning and 97.6MB in the end (delta: 27.5MB). Peak memory consumption was 100.2MB. 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 47088 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 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: inital95 mio100 ax100 hnf100 lsp327 ukn23 mio100 lsp76 div100 bol100 ite100 ukn100 eq156 hnf97 smp100 dnf312 smp35 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 70]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {m=0, N=1} State at position 1 is {array_max=0, array_min=0, diff=0, i1=0, i2=0, m=0, max_l=0, min_l=0, N=1} - 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; [L85] FORK 0 fork 1 computeMin(); [L86] FORK 0 fork 2, 2 computeMax(); [L87] FORK 0 fork 3, 3, 3 sample(); 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.4s, 45 PlacesBefore, 32 PlacesAfterwards, 36 TransitionsBefore, 23 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 414, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 315, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 315, positive: 303, positive conditional: 0, positive unconditional: 303, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 414, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 315, unknown conditional: 0, unknown unconditional: 315] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 RESULT: Ultimate proved your program to be incorrect! [2022-09-29 15:05:40,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-09-29 15:05:41,149 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 [2022-09-29 15:05:41,351 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...