30.27/20.83 YES 30.27/20.83 30.27/20.83 Ultimate: Cannot open display: 30.27/20.83 This is Ultimate 0.1.24-8dc7c08-m 30.27/20.83 [2019-03-29 02:06:29,999 INFO L170 SettingsManager]: Resetting all preferences to default values... 30.27/20.83 [2019-03-29 02:06:30,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 30.27/20.83 [2019-03-29 02:06:30,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 30.27/20.83 [2019-03-29 02:06:30,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 30.27/20.83 [2019-03-29 02:06:30,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 30.27/20.83 [2019-03-29 02:06:30,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 30.27/20.83 [2019-03-29 02:06:30,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 30.27/20.83 [2019-03-29 02:06:30,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 30.27/20.83 [2019-03-29 02:06:30,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 30.27/20.83 [2019-03-29 02:06:30,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 30.27/20.83 [2019-03-29 02:06:30,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 30.27/20.83 [2019-03-29 02:06:30,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 30.27/20.83 [2019-03-29 02:06:30,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 30.27/20.83 [2019-03-29 02:06:30,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 30.27/20.83 [2019-03-29 02:06:30,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 30.27/20.83 [2019-03-29 02:06:30,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 30.27/20.83 [2019-03-29 02:06:30,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 30.27/20.83 [2019-03-29 02:06:30,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 30.27/20.83 [2019-03-29 02:06:30,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 30.27/20.83 [2019-03-29 02:06:30,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 30.27/20.83 [2019-03-29 02:06:30,035 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 30.27/20.83 [2019-03-29 02:06:30,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 30.27/20.83 [2019-03-29 02:06:30,036 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 30.27/20.83 [2019-03-29 02:06:30,037 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 30.27/20.83 [2019-03-29 02:06:30,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 30.27/20.83 [2019-03-29 02:06:30,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 30.27/20.83 [2019-03-29 02:06:30,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 30.27/20.83 [2019-03-29 02:06:30,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 30.27/20.83 [2019-03-29 02:06:30,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 30.27/20.83 [2019-03-29 02:06:30,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 30.27/20.83 [2019-03-29 02:06:30,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 30.27/20.83 [2019-03-29 02:06:30,043 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 30.27/20.83 [2019-03-29 02:06:30,057 INFO L110 SettingsManager]: Loading preferences was successful 30.27/20.83 [2019-03-29 02:06:30,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 30.27/20.83 [2019-03-29 02:06:30,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 30.27/20.83 [2019-03-29 02:06:30,059 INFO L133 SettingsManager]: * Rewrite not-equals=true 30.27/20.83 [2019-03-29 02:06:30,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 30.27/20.83 [2019-03-29 02:06:30,059 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 30.27/20.83 [2019-03-29 02:06:30,059 INFO L133 SettingsManager]: * Use SBE=true 30.27/20.83 [2019-03-29 02:06:30,060 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 30.27/20.83 [2019-03-29 02:06:30,060 INFO L133 SettingsManager]: * Use old map elimination=false 30.27/20.83 [2019-03-29 02:06:30,060 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 30.27/20.83 [2019-03-29 02:06:30,060 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 30.27/20.83 [2019-03-29 02:06:30,060 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 30.27/20.83 [2019-03-29 02:06:30,061 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 30.27/20.83 [2019-03-29 02:06:30,061 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 30.27/20.83 [2019-03-29 02:06:30,061 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.83 [2019-03-29 02:06:30,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 30.27/20.83 [2019-03-29 02:06:30,061 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 30.27/20.83 [2019-03-29 02:06:30,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE 30.27/20.83 [2019-03-29 02:06:30,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 30.27/20.83 [2019-03-29 02:06:30,062 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 30.27/20.83 [2019-03-29 02:06:30,062 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 30.27/20.83 [2019-03-29 02:06:30,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 30.27/20.83 [2019-03-29 02:06:30,062 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 30.27/20.83 [2019-03-29 02:06:30,063 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 30.27/20.83 [2019-03-29 02:06:30,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.27/20.83 [2019-03-29 02:06:30,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 30.27/20.83 [2019-03-29 02:06:30,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 30.27/20.83 [2019-03-29 02:06:30,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 30.27/20.83 [2019-03-29 02:06:30,063 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 30.27/20.83 [2019-03-29 02:06:30,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 30.27/20.83 [2019-03-29 02:06:30,103 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 30.27/20.83 [2019-03-29 02:06:30,106 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 30.27/20.83 [2019-03-29 02:06:30,108 INFO L271 PluginConnector]: Initializing CDTParser... 30.27/20.83 [2019-03-29 02:06:30,108 INFO L276 PluginConnector]: CDTParser initialized 30.27/20.83 [2019-03-29 02:06:30,109 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 30.27/20.83 [2019-03-29 02:06:30,193 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2801904ae6d1463fbb0d8e4f989ce19c/FLAGa5e13205a 30.27/20.83 [2019-03-29 02:06:30,534 INFO L307 CDTParser]: Found 1 translation units. 30.27/20.83 [2019-03-29 02:06:30,535 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 30.27/20.83 [2019-03-29 02:06:30,542 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2801904ae6d1463fbb0d8e4f989ce19c/FLAGa5e13205a 30.27/20.83 [2019-03-29 02:06:30,950 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2801904ae6d1463fbb0d8e4f989ce19c 30.27/20.83 [2019-03-29 02:06:30,962 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 30.27/20.83 [2019-03-29 02:06:30,963 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 30.27/20.83 [2019-03-29 02:06:30,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 30.27/20.83 [2019-03-29 02:06:30,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 30.27/20.83 [2019-03-29 02:06:30,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 30.27/20.83 [2019-03-29 02:06:30,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:06:30" (1/1) ... 30.27/20.83 [2019-03-29 02:06:30,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d9f794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:30, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:30,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:06:30" (1/1) ... 30.27/20.83 [2019-03-29 02:06:30,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 30.27/20.83 [2019-03-29 02:06:30,999 INFO L176 MainTranslator]: Built tables and reachable declarations 30.27/20.83 [2019-03-29 02:06:31,160 INFO L206 PostProcessor]: Analyzing one entry point: main 30.27/20.83 [2019-03-29 02:06:31,164 INFO L191 MainTranslator]: Completed pre-run 30.27/20.83 [2019-03-29 02:06:31,183 INFO L206 PostProcessor]: Analyzing one entry point: main 30.27/20.83 [2019-03-29 02:06:31,259 INFO L195 MainTranslator]: Completed translation 30.27/20.83 [2019-03-29 02:06:31,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31 WrapperNode 30.27/20.83 [2019-03-29 02:06:31,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 30.27/20.83 [2019-03-29 02:06:31,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 30.27/20.83 [2019-03-29 02:06:31,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 30.27/20.83 [2019-03-29 02:06:31,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 30.27/20.83 [2019-03-29 02:06:31,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 30.27/20.83 [2019-03-29 02:06:31,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 30.27/20.83 [2019-03-29 02:06:31,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 30.27/20.83 [2019-03-29 02:06:31,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized 30.27/20.83 [2019-03-29 02:06:31,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 30.27/20.83 [2019-03-29 02:06:31,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 30.27/20.83 [2019-03-29 02:06:31,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... 30.27/20.83 [2019-03-29 02:06:31,323 INFO L276 PluginConnector]: RCFGBuilder initialized 30.27/20.83 [2019-03-29 02:06:31,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (1/1) ... 30.27/20.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.83 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 30.27/20.83 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.27/20.83 [2019-03-29 02:06:31,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 30.27/20.83 [2019-03-29 02:06:31,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 30.27/20.83 [2019-03-29 02:06:31,556 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 30.27/20.83 [2019-03-29 02:06:31,557 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 30.27/20.83 [2019-03-29 02:06:31,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:06:31 BoogieIcfgContainer 30.27/20.83 [2019-03-29 02:06:31,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 30.27/20.83 [2019-03-29 02:06:31,559 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 30.27/20.83 [2019-03-29 02:06:31,559 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 30.27/20.83 [2019-03-29 02:06:31,562 INFO L276 PluginConnector]: BlockEncodingV2 initialized 30.27/20.83 [2019-03-29 02:06:31,563 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:06:31" (1/1) ... 30.27/20.83 [2019-03-29 02:06:31,581 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 17 edges 30.27/20.83 [2019-03-29 02:06:31,583 INFO L258 BlockEncoder]: Using Remove infeasible edges 30.27/20.83 [2019-03-29 02:06:31,584 INFO L263 BlockEncoder]: Using Maximize final states 30.27/20.83 [2019-03-29 02:06:31,585 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 30.27/20.83 [2019-03-29 02:06:31,585 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 30.27/20.83 [2019-03-29 02:06:31,588 INFO L296 BlockEncoder]: Using Remove sink states 30.27/20.83 [2019-03-29 02:06:31,589 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 30.27/20.83 [2019-03-29 02:06:31,590 INFO L179 BlockEncoder]: Using Rewrite not-equals 30.27/20.83 [2019-03-29 02:06:31,607 INFO L185 BlockEncoder]: Using Use SBE 30.27/20.83 [2019-03-29 02:06:31,622 INFO L200 BlockEncoder]: SBE split 1 edges 30.27/20.83 [2019-03-29 02:06:31,627 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 30.27/20.83 [2019-03-29 02:06:31,629 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.27/20.83 [2019-03-29 02:06:31,643 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 30.27/20.83 [2019-03-29 02:06:31,646 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 30.27/20.83 [2019-03-29 02:06:31,647 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.27/20.83 [2019-03-29 02:06:31,647 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.27/20.83 [2019-03-29 02:06:31,653 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 30.27/20.83 [2019-03-29 02:06:31,653 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.27/20.83 [2019-03-29 02:06:31,654 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.27/20.83 [2019-03-29 02:06:31,654 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.27/20.83 [2019-03-29 02:06:31,654 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 30.27/20.83 [2019-03-29 02:06:31,654 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.27/20.83 [2019-03-29 02:06:31,655 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges 30.27/20.83 [2019-03-29 02:06:31,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:06:31 BasicIcfg 30.27/20.83 [2019-03-29 02:06:31,655 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 30.27/20.83 [2019-03-29 02:06:31,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 30.27/20.83 [2019-03-29 02:06:31,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... 30.27/20.83 [2019-03-29 02:06:31,660 INFO L276 PluginConnector]: TraceAbstraction initialized 30.27/20.83 [2019-03-29 02:06:31,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 02:06:30" (1/4) ... 30.27/20.83 [2019-03-29 02:06:31,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259e45a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (2/4) ... 30.27/20.83 [2019-03-29 02:06:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259e45a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:06:31" (3/4) ... 30.27/20.83 [2019-03-29 02:06:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259e45a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:06:31" (4/4) ... 30.27/20.83 [2019-03-29 02:06:31,664 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.27/20.83 [2019-03-29 02:06:31,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 30.27/20.83 [2019-03-29 02:06:31,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 30.27/20.83 [2019-03-29 02:06:31,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 30.27/20.83 [2019-03-29 02:06:31,728 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.27/20.83 [2019-03-29 02:06:31,729 INFO L382 AbstractCegarLoop]: Interprodecural is true 30.27/20.83 [2019-03-29 02:06:31,729 INFO L383 AbstractCegarLoop]: Hoare is true 30.27/20.83 [2019-03-29 02:06:31,729 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 30.27/20.83 [2019-03-29 02:06:31,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 30.27/20.83 [2019-03-29 02:06:31,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.27/20.83 [2019-03-29 02:06:31,730 INFO L387 AbstractCegarLoop]: Difference is false 30.27/20.83 [2019-03-29 02:06:31,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 30.27/20.83 [2019-03-29 02:06:31,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 30.27/20.83 [2019-03-29 02:06:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 30.27/20.83 [2019-03-29 02:06:31,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 30.27/20.83 [2019-03-29 02:06:31,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 30.27/20.83 [2019-03-29 02:06:31,806 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 30.27/20.83 [2019-03-29 02:06:31,806 INFO L451 ceAbstractionStarter]: At program point L28-2(lines 28 30) the Hoare annotation is: true 30.27/20.83 [2019-03-29 02:06:31,806 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: true 30.27/20.83 [2019-03-29 02:06:31,806 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: true 30.27/20.83 [2019-03-29 02:06:31,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:06:31 BasicIcfg 30.27/20.83 [2019-03-29 02:06:31,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 30.27/20.83 [2019-03-29 02:06:31,815 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 30.27/20.83 [2019-03-29 02:06:31,815 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 30.27/20.83 [2019-03-29 02:06:31,819 INFO L276 PluginConnector]: BuchiAutomizer initialized 30.27/20.83 [2019-03-29 02:06:31,819 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.27/20.83 [2019-03-29 02:06:31,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 02:06:30" (1/5) ... 30.27/20.83 [2019-03-29 02:06:31,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40757f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.27/20.83 [2019-03-29 02:06:31,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:06:31" (2/5) ... 30.27/20.83 [2019-03-29 02:06:31,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40757f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,821 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.27/20.83 [2019-03-29 02:06:31,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:06:31" (3/5) ... 30.27/20.83 [2019-03-29 02:06:31,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40757f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.27/20.83 [2019-03-29 02:06:31,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:06:31" (4/5) ... 30.27/20.83 [2019-03-29 02:06:31,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40757f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:06:31, skipping insertion in model container 30.27/20.83 [2019-03-29 02:06:31,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.27/20.83 [2019-03-29 02:06:31,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:06:31" (5/5) ... 30.27/20.83 [2019-03-29 02:06:31,824 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.27/20.83 [2019-03-29 02:06:31,852 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.27/20.83 [2019-03-29 02:06:31,852 INFO L374 BuchiCegarLoop]: Interprodecural is true 30.27/20.83 [2019-03-29 02:06:31,852 INFO L375 BuchiCegarLoop]: Hoare is true 30.27/20.83 [2019-03-29 02:06:31,852 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 30.27/20.83 [2019-03-29 02:06:31,853 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 30.27/20.83 [2019-03-29 02:06:31,853 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.27/20.83 [2019-03-29 02:06:31,853 INFO L379 BuchiCegarLoop]: Difference is false 30.27/20.83 [2019-03-29 02:06:31,853 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 30.27/20.83 [2019-03-29 02:06:31,853 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 30.27/20.83 [2019-03-29 02:06:31,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 30.27/20.83 [2019-03-29 02:06:31,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.27/20.83 [2019-03-29 02:06:31,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.83 [2019-03-29 02:06:31,875 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.83 [2019-03-29 02:06:31,881 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.27/20.83 [2019-03-29 02:06:31,881 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.27/20.83 [2019-03-29 02:06:31,881 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 30.27/20.83 [2019-03-29 02:06:31,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 30.27/20.83 [2019-03-29 02:06:31,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.27/20.83 [2019-03-29 02:06:31,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.83 [2019-03-29 02:06:31,882 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.83 [2019-03-29 02:06:31,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.27/20.83 [2019-03-29 02:06:31,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.27/20.83 [2019-03-29 02:06:31,888 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 4#L23-2true 30.27/20.83 [2019-03-29 02:06:31,888 INFO L796 eck$LassoCheckResult]: Loop: 4#L23-2true [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 6#L25-2true [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4#L23-2true 30.27/20.83 [2019-03-29 02:06:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.83 [2019-03-29 02:06:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times 30.27/20.83 [2019-03-29 02:06:31,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.83 [2019-03-29 02:06:31,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.83 [2019-03-29 02:06:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.83 [2019-03-29 02:06:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.83 [2019-03-29 02:06:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.83 [2019-03-29 02:06:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.83 [2019-03-29 02:06:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.83 [2019-03-29 02:06:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.83 [2019-03-29 02:06:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2803, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:31,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:31,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash 106591, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:31,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,041 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:32,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:32,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:32,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:32,043 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.27/20.84 [2019-03-29 02:06:32,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:32,044 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:32,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.27/20.84 [2019-03-29 02:06:32,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:32,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:32,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,182 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:32,183 INFO L412 LassoAnalysis]: Checking for nontermination... 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,190 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:32,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:32,226 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,236 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:32,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:32,264 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,271 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:32,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:32,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,304 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,336 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:32,515 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.27/20.84 [2019-03-29 02:06:32,518 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:32,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:32,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:32,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:32,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.27/20.84 [2019-03-29 02:06:32,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:32,519 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:32,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.27/20.84 [2019-03-29 02:06:32,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:32,519 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:32,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,611 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:32,617 INFO L497 LassoAnalysis]: Using template 'affine'. 30.27/20.84 [2019-03-29 02:06:32,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:32,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:32,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:32,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:32,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:32,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:32,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:32,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:32,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:32,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:32,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:32,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:32,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:32,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:32,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:32,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:32,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:32,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:32,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:32,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:32,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:32,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:32,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:32,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:32,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:32,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:32,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:32,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:32,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:32,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:32,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:32,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:32,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:32,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.27/20.84 [2019-03-29 02:06:32,669 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 30.27/20.84 [2019-03-29 02:06:32,670 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 30.27/20.84 [2019-03-29 02:06:32,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.27/20.84 [2019-03-29 02:06:32,672 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.27/20.84 [2019-03-29 02:06:32,672 INFO L518 LassoAnalysis]: Proved termination. 30.27/20.84 [2019-03-29 02:06:32,673 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.27/20.84 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 30.27/20.84 Supporting invariants [] 30.27/20.84 [2019-03-29 02:06:32,674 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.27/20.84 [2019-03-29 02:06:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:32,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:32,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:32,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:32,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.27/20.84 [2019-03-29 02:06:32,785 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 30.27/20.84 [2019-03-29 02:06:32,790 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 30.27/20.84 [2019-03-29 02:06:32,791 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 30.27/20.84 [2019-03-29 02:06:32,824 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 16 transitions. Complement of second has 4 states. 30.27/20.84 [2019-03-29 02:06:32,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 30.27/20.84 [2019-03-29 02:06:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.27/20.84 [2019-03-29 02:06:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 30.27/20.84 [2019-03-29 02:06:32,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:32,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:32,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:32,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:32,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. 30.27/20.84 [2019-03-29 02:06:32,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:32,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 16 transitions. 30.27/20.84 [2019-03-29 02:06:32,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 30.27/20.84 [2019-03-29 02:06:32,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:32,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 30.27/20.84 [2019-03-29 02:06:32,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 30.27/20.84 [2019-03-29 02:06:32,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:32,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.27/20.84 [2019-03-29 02:06:32,844 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 30.27/20.84 [2019-03-29 02:06:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 30.27/20.84 [2019-03-29 02:06:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 30.27/20.84 [2019-03-29 02:06:32,873 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 30.27/20.84 [2019-03-29 02:06:32,873 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 30.27/20.84 [2019-03-29 02:06:32,873 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 30.27/20.84 [2019-03-29 02:06:32,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. 30.27/20.84 [2019-03-29 02:06:32,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.27/20.84 [2019-03-29 02:06:32,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.84 [2019-03-29 02:06:32,874 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.84 [2019-03-29 02:06:32,875 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.27/20.84 [2019-03-29 02:06:32,875 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 30.27/20.84 [2019-03-29 02:06:32,875 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 54#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 52#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 47#L28-2 30.27/20.84 [2019-03-29 02:06:32,876 INFO L796 eck$LassoCheckResult]: Loop: 47#L28-2 [52] L28-2-->L28-2: Formula: (and (< v_ULTIMATE.start_main_~k~0_10 v_ULTIMATE.start_main_~N~0_9) (= v_ULTIMATE.start_main_~k~0_9 (+ v_ULTIMATE.start_main_~k~0_10 1))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 47#L28-2 30.27/20.84 [2019-03-29 02:06:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:32,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:32,889 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:32,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:32,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:32,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash 3303970, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:32,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:32,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:32,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:32,916 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:32,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:32,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:32,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:32,917 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.27/20.84 [2019-03-29 02:06:32,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:32,917 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:32,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.27/20.84 [2019-03-29 02:06:32,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:32,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:32,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:32,961 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:32,961 INFO L412 LassoAnalysis]: Checking for nontermination... 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,965 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:32,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:32,993 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:32,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:32,998 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:33,029 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:33,242 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.27/20.84 [2019-03-29 02:06:33,245 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:33,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:33,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:33,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:33,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.27/20.84 [2019-03-29 02:06:33,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:33,247 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:33,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.27/20.84 [2019-03-29 02:06:33,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:33,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:33,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,303 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:33,303 INFO L497 LassoAnalysis]: Using template 'affine'. 30.27/20.84 [2019-03-29 02:06:33,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:33,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:33,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:33,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:33,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:33,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:33,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:33,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:33,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:33,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:33,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:33,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:33,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:33,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:33,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:33,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:33,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.27/20.84 [2019-03-29 02:06:33,322 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.27/20.84 [2019-03-29 02:06:33,322 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 30.27/20.84 [2019-03-29 02:06:33,323 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.27/20.84 [2019-03-29 02:06:33,323 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.27/20.84 [2019-03-29 02:06:33,323 INFO L518 LassoAnalysis]: Proved termination. 30.27/20.84 [2019-03-29 02:06:33,323 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.27/20.84 Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 30.27/20.84 Supporting invariants [] 30.27/20.84 [2019-03-29 02:06:33,324 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.27/20.84 [2019-03-29 02:06:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:33,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:33,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:33,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:33,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.27/20.84 [2019-03-29 02:06:33,357 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 30.27/20.84 [2019-03-29 02:06:33,357 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 30.27/20.84 [2019-03-29 02:06:33,357 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 2 states. 30.27/20.84 [2019-03-29 02:06:33,369 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 12 states and 20 transitions. Complement of second has 4 states. 30.27/20.84 [2019-03-29 02:06:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 30.27/20.84 [2019-03-29 02:06:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 30.27/20.84 [2019-03-29 02:06:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 30.27/20.84 [2019-03-29 02:06:33,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. 30.27/20.84 [2019-03-29 02:06:33,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. 30.27/20.84 [2019-03-29 02:06:33,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:33,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 20 transitions. 30.27/20.84 [2019-03-29 02:06:33,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 30.27/20.84 [2019-03-29 02:06:33,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 16 transitions. 30.27/20.84 [2019-03-29 02:06:33,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 30.27/20.84 [2019-03-29 02:06:33,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 30.27/20.84 [2019-03-29 02:06:33,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 16 transitions. 30.27/20.84 [2019-03-29 02:06:33,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.27/20.84 [2019-03-29 02:06:33,376 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. 30.27/20.84 [2019-03-29 02:06:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 16 transitions. 30.27/20.84 [2019-03-29 02:06:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 30.27/20.84 [2019-03-29 02:06:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 30.27/20.84 [2019-03-29 02:06:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:33,378 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:33,378 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:33,378 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 30.27/20.84 [2019-03-29 02:06:33,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 30.27/20.84 [2019-03-29 02:06:33,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 30.27/20.84 [2019-03-29 02:06:33,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.84 [2019-03-29 02:06:33,380 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.84 [2019-03-29 02:06:33,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.27/20.84 [2019-03-29 02:06:33,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.27/20.84 [2019-03-29 02:06:33,380 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 106#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 104#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 98#L28-2 30.27/20.84 [2019-03-29 02:06:33,381 INFO L796 eck$LassoCheckResult]: Loop: 98#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 100#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 98#L28-2 30.27/20.84 [2019-03-29 02:06:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 2 times 30.27/20.84 [2019-03-29 02:06:33,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 3410, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:33,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:33,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash 102423907, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:33,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:33,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:33,440 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:33,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:33,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:33,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:33,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.27/20.84 [2019-03-29 02:06:33,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:33,442 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:33,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.27/20.84 [2019-03-29 02:06:33,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:33,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:33,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,531 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:33,532 INFO L412 LassoAnalysis]: Checking for nontermination... 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:33,537 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:33,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:33,546 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-8} Honda state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:33,575 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:33,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.27/20.84 [2019-03-29 02:06:33,604 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:33,611 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:33,642 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:33,839 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.27/20.84 [2019-03-29 02:06:33,841 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:33,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:33,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:33,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:33,842 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.27/20.84 [2019-03-29 02:06:33,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:33,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:33,842 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:33,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.27/20.84 [2019-03-29 02:06:33,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:33,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:33,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:33,919 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:33,920 INFO L497 LassoAnalysis]: Using template 'affine'. 30.27/20.84 [2019-03-29 02:06:33,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:33,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:33,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:33,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:33,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:33,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:33,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:33,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:33,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:33,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:33,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:33,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:33,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:33,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:33,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:33,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:33,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:33,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:33,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:33,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:33,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:33,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:33,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:33,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:33,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:33,938 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.27/20.84 [2019-03-29 02:06:33,942 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 30.27/20.84 [2019-03-29 02:06:33,942 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 30.27/20.84 [2019-03-29 02:06:33,943 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.27/20.84 [2019-03-29 02:06:33,943 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.27/20.84 [2019-03-29 02:06:33,943 INFO L518 LassoAnalysis]: Proved termination. 30.27/20.84 [2019-03-29 02:06:33,944 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.27/20.84 Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 30.27/20.84 Supporting invariants [] 30.27/20.84 [2019-03-29 02:06:33,944 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.27/20.84 [2019-03-29 02:06:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:33,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:33,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:33,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:33,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.27/20.84 [2019-03-29 02:06:33,973 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 30.27/20.84 [2019-03-29 02:06:33,974 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 30.27/20.84 [2019-03-29 02:06:33,974 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 3 states. 30.27/20.84 [2019-03-29 02:06:33,986 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 17 states and 29 transitions. Complement of second has 4 states. 30.27/20.84 [2019-03-29 02:06:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 30.27/20.84 [2019-03-29 02:06:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.27/20.84 [2019-03-29 02:06:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. 30.27/20.84 [2019-03-29 02:06:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 4 letters. 30.27/20.84 [2019-03-29 02:06:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:33,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. 30.27/20.84 [2019-03-29 02:06:33,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 30.27/20.84 [2019-03-29 02:06:33,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 28 transitions. 30.27/20.84 [2019-03-29 02:06:33,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 30.27/20.84 [2019-03-29 02:06:33,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 30.27/20.84 [2019-03-29 02:06:33,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. 30.27/20.84 [2019-03-29 02:06:33,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.27/20.84 [2019-03-29 02:06:33,992 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. 30.27/20.84 [2019-03-29 02:06:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. 30.27/20.84 [2019-03-29 02:06:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. 30.27/20.84 [2019-03-29 02:06:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 30.27/20.84 [2019-03-29 02:06:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. 30.27/20.84 [2019-03-29 02:06:33,995 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 30.27/20.84 [2019-03-29 02:06:33,995 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 30.27/20.84 [2019-03-29 02:06:33,995 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 30.27/20.84 [2019-03-29 02:06:33,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. 30.27/20.84 [2019-03-29 02:06:33,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 30.27/20.84 [2019-03-29 02:06:33,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.84 [2019-03-29 02:06:33,996 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.84 [2019-03-29 02:06:33,997 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.27/20.84 [2019-03-29 02:06:33,997 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 30.27/20.84 [2019-03-29 02:06:33,997 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 169#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 167#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 158#L28-2 30.27/20.84 [2019-03-29 02:06:33,997 INFO L796 eck$LassoCheckResult]: Loop: 158#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 162#L25-2 [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 163#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 164#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 158#L28-2 30.27/20.84 [2019-03-29 02:06:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 3 times 30.27/20.84 [2019-03-29 02:06:33,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:33,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:33,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 3291332, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:34,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:34,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:34,019 INFO L82 PathProgramCache]: Analyzing trace with hash -354858859, now seen corresponding path program 1 times 30.27/20.84 [2019-03-29 02:06:34,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:34,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:34,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:34,069 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:34,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:34,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:34,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:34,069 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.27/20.84 [2019-03-29 02:06:34,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:34,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:34,070 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:34,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.27/20.84 [2019-03-29 02:06:34,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:34,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:34,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:34,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:34,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:34,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:34,181 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:34,182 INFO L412 LassoAnalysis]: Checking for nontermination... 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:34,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:34,185 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:34,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:34,220 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:46,257 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 30.27/20.84 [2019-03-29 02:06:46,262 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:46,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:46,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:46,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:46,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.27/20.84 [2019-03-29 02:06:46,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:46,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:46,263 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:46,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.27/20.84 [2019-03-29 02:06:46,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:46,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:46,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,330 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:46,330 INFO L497 LassoAnalysis]: Using template 'affine'. 30.27/20.84 [2019-03-29 02:06:46,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:46,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:46,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:46,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:46,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:46,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:46,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:46,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:46,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.27/20.84 [2019-03-29 02:06:46,343 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 30.27/20.84 [2019-03-29 02:06:46,343 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 30.27/20.84 [2019-03-29 02:06:46,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.27/20.84 [2019-03-29 02:06:46,343 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.27/20.84 [2019-03-29 02:06:46,343 INFO L518 LassoAnalysis]: Proved termination. 30.27/20.84 [2019-03-29 02:06:46,344 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.27/20.84 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 30.27/20.84 Supporting invariants [] 30.27/20.84 [2019-03-29 02:06:46,344 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.27/20.84 [2019-03-29 02:06:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:46,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:46,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:46,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.27/20.84 [2019-03-29 02:06:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,419 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.27/20.84 [2019-03-29 02:06:46,419 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 30.27/20.84 [2019-03-29 02:06:46,419 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 30.27/20.84 [2019-03-29 02:06:46,419 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13 Second operand 5 states. 30.27/20.84 [2019-03-29 02:06:46,572 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 92 transitions. Complement of second has 22 states. 30.27/20.84 [2019-03-29 02:06:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 30.27/20.84 [2019-03-29 02:06:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 30.27/20.84 [2019-03-29 02:06:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. 30.27/20.84 [2019-03-29 02:06:46,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 4 letters. 30.27/20.84 [2019-03-29 02:06:46,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:46,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. 30.27/20.84 [2019-03-29 02:06:46,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:46,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 8 letters. 30.27/20.84 [2019-03-29 02:06:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:46,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 92 transitions. 30.27/20.84 [2019-03-29 02:06:46,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.27/20.84 [2019-03-29 02:06:46,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 74 transitions. 30.27/20.84 [2019-03-29 02:06:46,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 30.27/20.84 [2019-03-29 02:06:46,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 30.27/20.84 [2019-03-29 02:06:46,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 74 transitions. 30.27/20.84 [2019-03-29 02:06:46,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.27/20.84 [2019-03-29 02:06:46,584 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 74 transitions. 30.27/20.84 [2019-03-29 02:06:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 74 transitions. 30.27/20.84 [2019-03-29 02:06:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. 30.27/20.84 [2019-03-29 02:06:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 30.27/20.84 [2019-03-29 02:06:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. 30.27/20.84 [2019-03-29 02:06:46,588 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. 30.27/20.84 [2019-03-29 02:06:46,588 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. 30.27/20.84 [2019-03-29 02:06:46,588 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 30.27/20.84 [2019-03-29 02:06:46,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. 30.27/20.84 [2019-03-29 02:06:46,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.27/20.84 [2019-03-29 02:06:46,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.27/20.84 [2019-03-29 02:06:46,589 INFO L119 BuchiIsEmpty]: Starting construction of run 30.27/20.84 [2019-03-29 02:06:46,590 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 30.27/20.84 [2019-03-29 02:06:46,590 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.27/20.84 [2019-03-29 02:06:46,590 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 303#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 305#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 290#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 298#L25-2 30.27/20.84 [2019-03-29 02:06:46,591 INFO L796 eck$LassoCheckResult]: Loop: 298#L25-2 [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 299#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 298#L25-2 30.27/20.84 [2019-03-29 02:06:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash 3303995, now seen corresponding path program 2 times 30.27/20.84 [2019-03-29 02:06:46,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:46,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 3343, now seen corresponding path program 2 times 30.27/20.84 [2019-03-29 02:06:46,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1119825719, now seen corresponding path program 2 times 30.27/20.84 [2019-03-29 02:06:46,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.27/20.84 [2019-03-29 02:06:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.27/20.84 [2019-03-29 02:06:46,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.27/20.84 [2019-03-29 02:06:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.27/20.84 [2019-03-29 02:06:46,645 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:46,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:46,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:46,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:46,646 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.27/20.84 [2019-03-29 02:06:46,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:46,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:46,646 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:46,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 30.27/20.84 [2019-03-29 02:06:46,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:46,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:46,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:46,716 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:46,716 INFO L412 LassoAnalysis]: Checking for nontermination... 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:46,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:46,719 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.27/20.84 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.27/20.84 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:46,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.27/20.84 [2019-03-29 02:06:46,751 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.27/20.84 [2019-03-29 02:06:47,196 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.27/20.84 [2019-03-29 02:06:47,198 INFO L216 LassoAnalysis]: Preferences: 30.27/20.84 [2019-03-29 02:06:47,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.27/20.84 [2019-03-29 02:06:47,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.27/20.84 [2019-03-29 02:06:47,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.27/20.84 [2019-03-29 02:06:47,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.27/20.84 [2019-03-29 02:06:47,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.27/20.84 [2019-03-29 02:06:47,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.27/20.84 [2019-03-29 02:06:47,199 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.27/20.84 [2019-03-29 02:06:47,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 30.27/20.84 [2019-03-29 02:06:47,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.27/20.84 [2019-03-29 02:06:47,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.27/20.84 [2019-03-29 02:06:47,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:47,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:47,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:47,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.27/20.84 [2019-03-29 02:06:47,253 INFO L300 LassoAnalysis]: Preprocessing complete. 30.27/20.84 [2019-03-29 02:06:47,253 INFO L497 LassoAnalysis]: Using template 'affine'. 30.27/20.84 [2019-03-29 02:06:47,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:47,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:47,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:47,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:47,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:47,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:47,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:47,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.27/20.84 [2019-03-29 02:06:47,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.27/20.84 Termination analysis: LINEAR_WITH_GUESSES 30.27/20.84 Number of strict supporting invariants: 0 30.27/20.84 Number of non-strict supporting invariants: 1 30.27/20.84 Consider only non-deceasing supporting invariants: true 30.27/20.84 Simplify termination arguments: true 30.27/20.84 Simplify supporting invariants: trueOverapproximate stem: false 30.27/20.84 [2019-03-29 02:06:47,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.27/20.84 [2019-03-29 02:06:47,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.27/20.84 [2019-03-29 02:06:47,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.27/20.84 [2019-03-29 02:06:47,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.27/20.84 [2019-03-29 02:06:47,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.27/20.84 [2019-03-29 02:06:47,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.27/20.84 [2019-03-29 02:06:47,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.27/20.84 [2019-03-29 02:06:47,264 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.27/20.84 [2019-03-29 02:06:47,266 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.27/20.84 [2019-03-29 02:06:47,266 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 30.27/20.84 [2019-03-29 02:06:47,267 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.27/20.84 [2019-03-29 02:06:47,267 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.27/20.84 [2019-03-29 02:06:47,267 INFO L518 LassoAnalysis]: Proved termination. 30.27/20.84 [2019-03-29 02:06:47,267 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.27/20.84 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 30.27/20.84 Supporting invariants [] 30.27/20.84 [2019-03-29 02:06:47,268 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.27/20.84 [2019-03-29 02:06:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.27/20.84 [2019-03-29 02:06:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:47,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:47,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.27/20.84 [2019-03-29 02:06:47,301 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 30.27/20.84 [2019-03-29 02:06:47,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.27/20.84 [2019-03-29 02:06:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.27/20.84 [2019-03-29 02:06:47,310 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 30.27/20.84 [2019-03-29 02:06:47,310 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 30.27/20.84 [2019-03-29 02:06:47,311 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32 Second operand 3 states. 30.27/20.84 [2019-03-29 02:06:47,334 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32. Second operand 3 states. Result 34 states and 75 transitions. Complement of second has 6 states. 30.27/20.84 [2019-03-29 02:06:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 30.27/20.84 [2019-03-29 02:06:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.27/20.84 [2019-03-29 02:06:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. 30.27/20.84 [2019-03-29 02:06:47,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:47,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:47,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. 30.27/20.84 [2019-03-29 02:06:47,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:47,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. 30.27/20.84 [2019-03-29 02:06:47,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.27/20.84 [2019-03-29 02:06:47,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 75 transitions. 30.27/20.84 [2019-03-29 02:06:47,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.27/20.84 [2019-03-29 02:06:47,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 30.27/20.84 [2019-03-29 02:06:47,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 30.27/20.84 [2019-03-29 02:06:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.27/20.84 [2019-03-29 02:06:47,339 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,339 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,339 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,340 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 30.27/20.84 [2019-03-29 02:06:47,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 30.27/20.84 [2019-03-29 02:06:47,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.27/20.84 [2019-03-29 02:06:47,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 30.27/20.84 [2019-03-29 02:06:47,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:06:47 BasicIcfg 30.27/20.84 [2019-03-29 02:06:47,346 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 30.27/20.84 [2019-03-29 02:06:47,347 INFO L168 Benchmark]: Toolchain (without parser) took 16384.16 ms. Allocated memory was 649.6 MB in the beginning and 745.5 MB in the end (delta: 95.9 MB). Free memory was 557.9 MB in the beginning and 573.2 MB in the end (delta: -15.3 MB). Peak memory consumption was 80.7 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,348 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.61 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 557.9 MB in the beginning and 634.6 MB in the end (delta: -76.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.61 ms. Allocated memory is still 666.9 MB. Free memory was 634.6 MB in the beginning and 633.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,350 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 ms. Allocated memory is still 666.9 MB. Free memory was 633.5 MB in the beginning and 629.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,350 INFO L168 Benchmark]: RCFGBuilder took 236.22 ms. Allocated memory is still 666.9 MB. Free memory was 629.6 MB in the beginning and 615.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,351 INFO L168 Benchmark]: BlockEncodingV2 took 96.67 ms. Allocated memory is still 666.9 MB. Free memory was 615.0 MB in the beginning and 608.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,351 INFO L168 Benchmark]: TraceAbstraction took 158.15 ms. Allocated memory is still 666.9 MB. Free memory was 608.5 MB in the beginning and 599.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,352 INFO L168 Benchmark]: BuchiAutomizer took 15530.92 ms. Allocated memory was 666.9 MB in the beginning and 745.5 MB in the end (delta: 78.6 MB). Free memory was 598.7 MB in the beginning and 573.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 104.2 MB. Max. memory is 50.3 GB. 30.27/20.84 [2019-03-29 02:06:47,356 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 30.27/20.84 --- Results --- 30.27/20.84 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 30.27/20.84 - StatisticsResult: Initial Icfg 30.27/20.84 11 locations, 17 edges 30.27/20.84 - StatisticsResult: Encoded RCFG 30.27/20.84 4 locations, 6 edges 30.27/20.84 * Results from de.uni_freiburg.informatik.ultimate.core: 30.27/20.84 - StatisticsResult: Toolchain Benchmarks 30.27/20.84 Benchmark results are: 30.27/20.84 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.27/20.84 * CACSL2BoogieTranslator took 295.61 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 557.9 MB in the beginning and 634.6 MB in the end (delta: -76.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 30.27/20.84 * Boogie Procedure Inliner took 39.61 ms. Allocated memory is still 666.9 MB. Free memory was 634.6 MB in the beginning and 633.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 30.27/20.84 * Boogie Preprocessor took 21.69 ms. Allocated memory is still 666.9 MB. Free memory was 633.5 MB in the beginning and 629.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 30.27/20.84 * RCFGBuilder took 236.22 ms. Allocated memory is still 666.9 MB. Free memory was 629.6 MB in the beginning and 615.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 30.27/20.84 * BlockEncodingV2 took 96.67 ms. Allocated memory is still 666.9 MB. Free memory was 615.0 MB in the beginning and 608.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 30.27/20.84 * TraceAbstraction took 158.15 ms. Allocated memory is still 666.9 MB. Free memory was 608.5 MB in the beginning and 599.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 30.27/20.84 * BuchiAutomizer took 15530.92 ms. Allocated memory was 666.9 MB in the beginning and 745.5 MB in the end (delta: 78.6 MB). Free memory was 598.7 MB in the beginning and 573.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 104.2 MB. Max. memory is 50.3 GB. 30.27/20.84 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 30.27/20.84 - AllSpecificationsHoldResult: All specifications hold 30.27/20.84 We were not able to verify any specifiation because the program does not contain any specification. 30.27/20.84 - InvariantResult [Line: 28]: Loop Invariant 30.27/20.84 Derived loop invariant: 1 30.27/20.84 - InvariantResult [Line: 23]: Loop Invariant 30.27/20.84 Derived loop invariant: 1 30.27/20.84 - InvariantResult [Line: 25]: Loop Invariant 30.27/20.84 Derived loop invariant: 1 30.27/20.84 - StatisticsResult: Ultimate Automizer benchmark data 30.27/20.84 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 30.27/20.84 - StatisticsResult: Constructed decomposition of program 30.27/20.84 Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function n + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 3 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. One nondeterministic module has affine ranking function n + -1 * k and consists of 8 locations. One nondeterministic module has affine ranking function n + -1 * i and consists of 4 locations. 30.27/20.84 - StatisticsResult: Timing statistics 30.27/20.84 BüchiAutomizer plugin needed 15.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 14.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 40 SDtfs, 47 SDslu, 7 SDs, 0 SdLazy, 65 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax176 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf112 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.4s 30.27/20.84 - TerminationAnalysisResult: Termination proven 30.27/20.84 Buchi Automizer proved that your program is terminating 30.27/20.84 RESULT: Ultimate proved your program to be correct! 30.27/20.84 !SESSION 2019-03-29 02:06:27.677 ----------------------------------------------- 30.27/20.84 eclipse.buildId=unknown 30.27/20.84 java.version=1.8.0_181 30.27/20.84 java.vendor=Oracle Corporation 30.27/20.84 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 30.27/20.84 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.27/20.84 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.27/20.84 30.27/20.84 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 02:06:47.589 30.27/20.84 !MESSAGE The workspace will exit with unsaved changes in this session. 30.27/20.84 Received shutdown request... 30.27/20.84 Ultimate: 30.27/20.84 GTK+ Version Check 30.27/20.84 EOF