/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-nonatomic.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:05:38,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:05:38,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:05:38,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:05:38,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:05:38,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:05:38,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:05:38,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:05:38,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:05:38,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:05:38,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:05:38,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:05:38,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:05:38,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:05:38,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:05:38,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:05:38,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:05:39,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:05:39,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:05:39,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:05:39,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:05:39,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:05:39,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:05:39,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:05:39,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:05:39,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:05:39,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:05:39,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:05:39,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:05:39,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:05:39,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:05:39,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:05:39,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:05:39,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:05:39,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:05:39,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:05:39,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:05:39,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:05:39,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:05:39,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:05:39,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:05:39,014 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:39,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:05:39,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:05:39,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:05:39,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:05:39,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:05:39,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:05:39,029 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:05:39,029 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:05:39,029 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:05:39,029 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 15:05:39,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:05:39,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:05:39,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:05:39,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:05:39,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:05:39,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:05:39,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:05:39,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:05:39,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:05:39,036 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:05:39,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:05:39,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:05:39,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:05:39,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:05:39,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:05:39,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:05:39,037 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:05:39,037 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:39,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:05:39,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:05:39,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:05:39,238 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:05:39,238 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:05:39,239 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-nonatomic.bpl [2022-09-29 15:05:39,239 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl' [2022-09-29 15:05:39,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:05:39,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:05:39,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:05:39,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:05:39,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:05:39,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,283 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:05:39,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:05:39,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:05:39,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:05:39,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:05:39,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:05:39,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:05:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:05:39,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:05:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/1) ... [2022-09-29 15:05:39,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:39,333 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:39,344 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:39,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2022-09-29 15:05:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2022-09-29 15:05:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2022-09-29 15:05:39,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:05:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:05:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:05:39,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2022-09-29 15:05:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2022-09-29 15:05:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2022-09-29 15:05:39,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2022-09-29 15:05:39,368 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2022-09-29 15:05:39,368 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2022-09-29 15:05:39,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2022-09-29 15:05:39,369 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2022-09-29 15:05:39,369 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2022-09-29 15:05:39,371 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:39,406 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:05:39,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:05:39,571 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:05:39,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:05:39,576 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 15:05:39,578 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:05:39 BoogieIcfgContainer [2022-09-29 15:05:39,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:05:39,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:05:39,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:05:39,581 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:05:39,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:05:39,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:05:39" (1/2) ... [2022-09-29 15:05:39,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@685e3663 and model type min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:05:39, skipping insertion in model container [2022-09-29 15:05:39,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:05:39,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:05:39" (2/2) ... [2022-09-29 15:05:39,597 INFO L322 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-nonatomic.bpl [2022-09-29 15:05:39,663 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-09-29 15:05:39,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 126 flow [2022-09-29 15:05:39,715 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:05:39,715 INFO L123 PetriNetUnfolderBase]: 6/39 cut-off events. [2022-09-29 15:05:39,715 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:05:39,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-09-29 15:05:39,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 126 flow [2022-09-29 15:05:39,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 102 flow [2022-09-29 15:05:39,727 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:05:39,737 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 102 flow [2022-09-29 15:05:39,739 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 102 flow [2022-09-29 15:05:39,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 102 flow [2022-09-29 15:05:39,747 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:05:39,747 INFO L123 PetriNetUnfolderBase]: 6/39 cut-off events. [2022-09-29 15:05:39,748 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:05:39,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 98 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-09-29 15:05:39,749 INFO L116 LiptonReduction]: Number of co-enabled transitions 738 [2022-09-29 15:05:40,105 INFO L131 LiptonReduction]: Checked pairs total: 743 [2022-09-29 15:05:40,105 INFO L133 LiptonReduction]: Total number of compositions: 21 [2022-09-29 15:05:40,113 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:05:40,113 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:05:40,113 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:05:40,114 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:05:40,114 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:05:40,114 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:05:40,114 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:05:40,114 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 15:05:40,114 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 31 places, 22 transitions, 68 flow [2022-09-29 15:05:40,117 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 31 places, 22 transitions, 68 flow [2022-09-29 15:05:40,118 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,118 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:40,118 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:05:40,118 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:05:40,118 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:40,120 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:05:40,120 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 31 places, 22 transitions, 68 flow [2022-09-29 15:05:40,121 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 31 places, 22 transitions, 68 flow [2022-09-29 15:05:40,121 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:40,121 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:40,121 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:05:40,121 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:05:40,121 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:40,124 INFO L733 eck$LassoCheckResult]: Stem: 54#[ULTIMATE.startENTRY]true [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[L79, computeMinENTRY]true [151] computeMinENTRY-->L28-1: Formula: (and (= v_array_min_23 (select v_A_41 0)) (= v_computeMinThread1of1ForFork0_i1_33 0)) InVars {A=v_A_41} OutVars{A=v_A_41, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_33, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 58#[L79, L28-1]true [2022-09-29 15:05:40,125 INFO L735 eck$LassoCheckResult]: Loop: 58#[L79, L28-1]true [164] L28-1-->L28-1: Formula: (let ((.cse3 (let ((.cse4 (select v_A_In_1 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse4 0) (- .cse4) .cse4)))) (let ((.cse0 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse1 (< .cse3 v_array_min_In_1)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_1))) (or (and .cse0 (= v_array_min_Out_2 v_array_min_In_1) (not .cse1) .cse2) (and (= v_array_min_Out_2 .cse3) .cse0 .cse1 .cse2)))) InVars {A=v_A_In_1, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_1} OutVars{A=v_A_In_1, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 58#[L79, L28-1]true [2022-09-29 15:05:40,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 5173, now seen corresponding path program 1 times [2022-09-29 15:05:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8898699] [2022-09-29 15:05:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash 195, now seen corresponding path program 1 times [2022-09-29 15:05:40,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123479088] [2022-09-29 15:05:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash 160527, now seen corresponding path program 1 times [2022-09-29 15:05:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:40,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940006484] [2022-09-29 15:05:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:40,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:40,388 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:05:40,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:05:40,388 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:05:40,388 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:05:40,388 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:05:40,388 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:05:40,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:05:40,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:05:40,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:05:40,390 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:05:40,412 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,423 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,611 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:05:40,613 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:05:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,640 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:40,647 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:40,648 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,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:40,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:40,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:40,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:40,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:40,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:40,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:05:40,730 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:40,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,732 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:40,733 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:40,734 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,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:40,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:40,741 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-09-29 15:05:40,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:40,778 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-09-29 15:05:40,778 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-09-29 15:05:40,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:05:40,839 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:40,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,841 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:40,843 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:40,845 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,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:40,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:40,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:40,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:40,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:40,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:40,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:05:40,903 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-09-29 15:05:40,903 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:05:40,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:40,915 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,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:05:40,952 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,954 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:05:40,954 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:05:40,954 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:40,987 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 [2022-09-29 15:05:40,989 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:05:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:41,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:05:41,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:41,078 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:05:41,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:41,079 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:41,107 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:41,109 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:05:41,235 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 592 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:05:41,236 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:05:41,239 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:05:41,241 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:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:05:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-09-29 15:05:41,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 2 letters. Loop has 1 letters. [2022-09-29 15:05:41,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:05:41,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 2 letters. Loop has 2 letters. [2022-09-29 15:05:41,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,249 INFO L428 stractBuchiCegarLoop]: Abstraction has has 43 places, 374 transitions, 1910 flow [2022-09-29 15:05:41,249 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:05:41,249 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 43 places, 374 transitions, 1910 flow [2022-09-29 15:05:41,251 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 43 places, 374 transitions, 1910 flow [2022-09-29 15:05:41,252 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,252 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 43 places, 374 transitions, 1910 flow [2022-09-29 15:05:41,253 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,254 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 43 places, 374 transitions, 1910 flow [2022-09-29 15:05:41,255 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,255 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:41,255 INFO L123 PetriNetUnfolderBase]: 4/12 cut-off events. [2022-09-29 15:05:41,255 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:05:41,255 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:41,256 INFO L733 eck$LassoCheckResult]: Stem: 54#[ULTIMATE.startENTRY]true [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[L79, computeMinENTRY]true [134] L79-->computeMaxENTRY: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 104#[computeMaxENTRY, computeMinENTRY, L80]true [149] computeMaxENTRY-->L44-1: Formula: (and (= (select v_A_33 0) v_array_max_12) (= v_computeMaxThread1of1ForFork1_i2_19 0)) InVars {A=v_A_33} OutVars{A=v_A_33, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_19, array_max=v_array_max_12} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 106#[computeMinENTRY, L44-1, L80]true [2022-09-29 15:05:41,256 INFO L735 eck$LassoCheckResult]: Loop: 106#[computeMinENTRY, L44-1, L80]true [165] L44-1-->L44-1: Formula: (let ((.cse3 (let ((.cse4 (select v_A_In_3 v_computeMaxThread1of1ForFork1_i2_In_1))) (ite (< .cse4 0) (- .cse4) .cse4)))) (let ((.cse0 (= v_computeMaxThread1of1ForFork1_i2_Out_2 (+ v_computeMaxThread1of1ForFork1_i2_In_1 1))) (.cse1 (< v_computeMaxThread1of1ForFork1_i2_In_1 v_N_In_3)) (.cse2 (< v_array_max_In_1 .cse3))) (or (and (= v_array_max_In_1 v_array_max_Out_2) .cse0 .cse1 (not .cse2)) (and .cse0 .cse1 (= v_array_max_Out_2 .cse3) .cse2)))) InVars {A=v_A_In_3, N=v_N_In_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_In_1, array_max=v_array_max_In_1} OutVars{A=v_A_In_3, N=v_N_In_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_Out_2, array_max=v_array_max_Out_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 106#[computeMinENTRY, L44-1, L80]true [2022-09-29 15:05:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 159985, now seen corresponding path program 1 times [2022-09-29 15:05:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657705782] [2022-09-29 15:05:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2022-09-29 15:05:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286434278] [2022-09-29 15:05:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash 4959700, now seen corresponding path program 1 times [2022-09-29 15:05:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:41,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437071023] [2022-09-29 15:05:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:41,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:41,381 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:05:41,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:05:41,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:05:41,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:05:41,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:05:41,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:41,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:05:41,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:05:41,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:05:41,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:05:41,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:05:41,383 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:41,437 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:41,439 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:41,441 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:41,442 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:41,505 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:41,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:05:41,588 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:05:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:41,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:41,604 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:41,619 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:41,622 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:41,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:41,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:41,629 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-09-29 15:05:41,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:41,652 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-09-29 15:05:41,652 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-09-29 15:05:41,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:05:41,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-09-29 15:05:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:41,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:05:41,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-09-29 15:05:41,739 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:41,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:05:41,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:05:41,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:05:41,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:05:41,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:05:41,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:05:41,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:05:41,773 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:05:41,773 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:05:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:05:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:05:41,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:05:41,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-09-29 15:05:41,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:05:41,797 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:05:41,798 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:05:41,798 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:41,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-09-29 15:05:41,816 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:05:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:41,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:05:41,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:05:41,835 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:05:41,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:05:41,836 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:41,836 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:41,836 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:41,923 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 592 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:05:41,924 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:05:41,954 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:05:41,955 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:41,955 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:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-09-29 15:05:41,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:05:41,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:05:41,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 198 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:05:41,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:05:41,957 INFO L428 stractBuchiCegarLoop]: Abstraction has has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,957 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:05:41,957 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,970 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,974 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,975 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,978 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,980 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,985 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,989 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:41,995 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:41,996 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:42,002 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:42,017 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 55 places, 6336 transitions, 45144 flow [2022-09-29 15:05:42,051 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:05:42,051 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:05:42,051 INFO L123 PetriNetUnfolderBase]: 90/127 cut-off events. [2022-09-29 15:05:42,051 INFO L124 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2022-09-29 15:05:42,051 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:05:42,052 INFO L733 eck$LassoCheckResult]: Stem: 54#[ULTIMATE.startENTRY]true [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[L79, computeMinENTRY]true [134] L79-->computeMaxENTRY: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 104#[computeMaxENTRY, computeMinENTRY, L80]true [137] L80-->L68: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 151#[L68, computeMaxENTRY, computeMinENTRY, L81]true [2022-09-29 15:05:42,052 INFO L735 eck$LassoCheckResult]: Loop: 151#[L68, computeMaxENTRY, computeMinENTRY, L81]true [116] L68-->L70: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l] 154#[computeMaxENTRY, computeMinENTRY, L81, L70]true [150] L70-->L68: Formula: (and (= v_sampleThread1of1ForFork2_diff_5 (+ (* (- 1) v_sampleThread1of1ForFork2_min_l_9) v_sampleThread1of1ForFork2_max_l_9)) (= v_array_max_17 v_sampleThread1of1ForFork2_max_l_9)) InVars {array_max=v_array_max_17, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_17, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_9} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 151#[L68, computeMaxENTRY, computeMinENTRY, L81]true [2022-09-29 15:05:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 159973, now seen corresponding path program 1 times [2022-09-29 15:05:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970449384] [2022-09-29 15:05:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 4707, now seen corresponding path program 1 times [2022-09-29 15:05:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:42,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447063492] [2022-09-29 15:05:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:05:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 153737799, now seen corresponding path program 1 times [2022-09-29 15:05:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:05:42,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066679038] [2022-09-29 15:05:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:05:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:05:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:05:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:05:42,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:05:42,108 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:05:42 BoogieIcfgContainer [2022-09-29 15:05:42,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:05:42,109 INFO L158 Benchmark]: Toolchain (without parser) took 2846.53ms. Allocated memory was 197.1MB in the beginning and 256.9MB in the end (delta: 59.8MB). Free memory was 150.2MB in the beginning and 160.1MB in the end (delta: -9.9MB). Peak memory consumption was 50.8MB. Max. memory is 8.0GB. [2022-09-29 15:05:42,109 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:05:42,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.37ms. Allocated memory is still 197.1MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-29 15:05:42,110 INFO L158 Benchmark]: Boogie Preprocessor took 21.62ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 147.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:05:42,110 INFO L158 Benchmark]: RCFGBuilder took 270.20ms. Allocated memory is still 197.1MB. Free memory was 147.6MB in the beginning and 167.0MB in the end (delta: -19.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-09-29 15:05:42,111 INFO L158 Benchmark]: BuchiAutomizer took 2530.35ms. Allocated memory was 197.1MB in the beginning and 256.9MB in the end (delta: 59.8MB). Free memory was 167.0MB in the beginning and 160.1MB in the end (delta: 6.8MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2022-09-29 15:05:42,112 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 197.1MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.37ms. Allocated memory is still 197.1MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.62ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 147.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 270.20ms. Allocated memory is still 197.1MB. Free memory was 147.6MB in the beginning and 167.0MB in the end (delta: -19.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 2530.35ms. Allocated memory was 197.1MB in the beginning and 256.9MB in the end (delta: 59.8MB). Free memory was 167.0MB in the beginning and 160.1MB in the end (delta: 6.8MB). Peak memory consumption was 65.8MB. 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 45144 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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, 255 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 136 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital102 mio100 ax100 hnf100 lsp192 ukn30 mio100 lsp81 div100 bol100 ite100 ukn100 eq148 hnf97 smp100 dnf400 smp27 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 84ms 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 - FixpointNonTerminationResult [Line: 68]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {array_max=0, array_min=0, diff=0, i1=0, i2=0, max_l=0, min_l=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 68]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 31 PlacesAfterwards, 39 TransitionsBefore, 22 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 743 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 635, positive: 625, positive conditional: 0, positive unconditional: 625, 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: 455, positive: 446, positive conditional: 0, positive unconditional: 446, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455, positive: 438, positive conditional: 0, positive unconditional: 438, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 635, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 455, unknown conditional: 0, unknown unconditional: 455] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, 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:42,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-09-29 15:05:42,363 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...