20.49/9.55 YES 20.49/9.55 20.49/9.55 Ultimate: Cannot open display: 20.49/9.55 This is Ultimate 0.1.24-8dc7c08-m 20.49/9.55 [2019-03-28 12:02:31,041 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.49/9.55 [2019-03-28 12:02:31,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.49/9.55 [2019-03-28 12:02:31,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.49/9.55 [2019-03-28 12:02:31,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.49/9.55 [2019-03-28 12:02:31,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.49/9.55 [2019-03-28 12:02:31,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.49/9.55 [2019-03-28 12:02:31,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.49/9.55 [2019-03-28 12:02:31,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.49/9.55 [2019-03-28 12:02:31,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.49/9.55 [2019-03-28 12:02:31,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.49/9.55 [2019-03-28 12:02:31,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.49/9.55 [2019-03-28 12:02:31,066 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.49/9.55 [2019-03-28 12:02:31,067 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.49/9.55 [2019-03-28 12:02:31,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.49/9.55 [2019-03-28 12:02:31,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.49/9.55 [2019-03-28 12:02:31,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.49/9.55 [2019-03-28 12:02:31,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.49/9.55 [2019-03-28 12:02:31,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.49/9.55 [2019-03-28 12:02:31,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.49/9.55 [2019-03-28 12:02:31,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.49/9.55 [2019-03-28 12:02:31,080 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.49/9.55 [2019-03-28 12:02:31,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.49/9.55 [2019-03-28 12:02:31,081 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.49/9.55 [2019-03-28 12:02:31,082 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.49/9.55 [2019-03-28 12:02:31,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.49/9.55 [2019-03-28 12:02:31,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.49/9.55 [2019-03-28 12:02:31,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.49/9.55 [2019-03-28 12:02:31,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.49/9.55 [2019-03-28 12:02:31,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.49/9.55 [2019-03-28 12:02:31,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.49/9.55 [2019-03-28 12:02:31,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.49/9.55 [2019-03-28 12:02:31,088 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.49/9.55 [2019-03-28 12:02:31,103 INFO L110 SettingsManager]: Loading preferences was successful 20.49/9.55 [2019-03-28 12:02:31,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.49/9.55 [2019-03-28 12:02:31,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.49/9.55 [2019-03-28 12:02:31,104 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.49/9.55 [2019-03-28 12:02:31,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.49/9.55 [2019-03-28 12:02:31,105 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.49/9.55 [2019-03-28 12:02:31,105 INFO L133 SettingsManager]: * Use SBE=true 20.49/9.55 [2019-03-28 12:02:31,105 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.49/9.55 [2019-03-28 12:02:31,105 INFO L133 SettingsManager]: * Use old map elimination=false 20.49/9.55 [2019-03-28 12:02:31,105 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.49/9.55 [2019-03-28 12:02:31,106 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.49/9.55 [2019-03-28 12:02:31,106 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.49/9.55 [2019-03-28 12:02:31,106 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.49/9.55 [2019-03-28 12:02:31,106 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.49/9.55 [2019-03-28 12:02:31,106 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:31,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.49/9.55 [2019-03-28 12:02:31,107 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.49/9.55 [2019-03-28 12:02:31,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.49/9.55 [2019-03-28 12:02:31,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.49/9.55 [2019-03-28 12:02:31,107 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.49/9.55 [2019-03-28 12:02:31,107 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.49/9.55 [2019-03-28 12:02:31,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.49/9.55 [2019-03-28 12:02:31,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.49/9.55 [2019-03-28 12:02:31,108 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.49/9.55 [2019-03-28 12:02:31,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.49/9.55 [2019-03-28 12:02:31,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.49/9.55 [2019-03-28 12:02:31,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.49/9.55 [2019-03-28 12:02:31,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.49/9.55 [2019-03-28 12:02:31,109 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.49/9.55 [2019-03-28 12:02:31,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.49/9.55 [2019-03-28 12:02:31,148 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.49/9.55 [2019-03-28 12:02:31,152 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.49/9.55 [2019-03-28 12:02:31,153 INFO L271 PluginConnector]: Initializing CDTParser... 20.49/9.55 [2019-03-28 12:02:31,154 INFO L276 PluginConnector]: CDTParser initialized 20.49/9.55 [2019-03-28 12:02:31,155 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.49/9.55 [2019-03-28 12:02:31,218 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1e922a9b49c048e6956c4049230ee177/FLAG47462bfb9 20.49/9.55 [2019-03-28 12:02:31,549 INFO L307 CDTParser]: Found 1 translation units. 20.49/9.55 [2019-03-28 12:02:31,550 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.49/9.55 [2019-03-28 12:02:31,556 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1e922a9b49c048e6956c4049230ee177/FLAG47462bfb9 20.49/9.55 [2019-03-28 12:02:31,999 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1e922a9b49c048e6956c4049230ee177 20.49/9.55 [2019-03-28 12:02:32,010 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.49/9.55 [2019-03-28 12:02:32,012 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.49/9.55 [2019-03-28 12:02:32,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.49/9.55 [2019-03-28 12:02:32,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.49/9.55 [2019-03-28 12:02:32,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.49/9.55 [2019-03-28 12:02:32,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69380b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.49/9.55 [2019-03-28 12:02:32,048 INFO L176 MainTranslator]: Built tables and reachable declarations 20.49/9.55 [2019-03-28 12:02:32,213 INFO L206 PostProcessor]: Analyzing one entry point: main 20.49/9.55 [2019-03-28 12:02:32,218 INFO L191 MainTranslator]: Completed pre-run 20.49/9.55 [2019-03-28 12:02:32,239 INFO L206 PostProcessor]: Analyzing one entry point: main 20.49/9.55 [2019-03-28 12:02:32,253 INFO L195 MainTranslator]: Completed translation 20.49/9.55 [2019-03-28 12:02:32,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32 WrapperNode 20.49/9.55 [2019-03-28 12:02:32,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.49/9.55 [2019-03-28 12:02:32,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.49/9.55 [2019-03-28 12:02:32,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.49/9.55 [2019-03-28 12:02:32,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.49/9.55 [2019-03-28 12:02:32,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.49/9.55 [2019-03-28 12:02:32,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.49/9.55 [2019-03-28 12:02:32,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.49/9.55 [2019-03-28 12:02:32,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.49/9.55 [2019-03-28 12:02:32,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.49/9.55 [2019-03-28 12:02:32,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.49/9.55 [2019-03-28 12:02:32,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.49/9.55 [2019-03-28 12:02:32,380 INFO L276 PluginConnector]: RCFGBuilder initialized 20.49/9.55 [2019-03-28 12:02:32,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.49/9.55 [2019-03-28 12:02:32,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.49/9.55 [2019-03-28 12:02:32,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.49/9.55 [2019-03-28 12:02:32,627 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.49/9.55 [2019-03-28 12:02:32,627 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.49/9.55 [2019-03-28 12:02:32,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32 BoogieIcfgContainer 20.49/9.55 [2019-03-28 12:02:32,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.49/9.55 [2019-03-28 12:02:32,629 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.49/9.55 [2019-03-28 12:02:32,629 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.49/9.55 [2019-03-28 12:02:32,632 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.49/9.55 [2019-03-28 12:02:32,633 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (1/1) ... 20.49/9.55 [2019-03-28 12:02:32,649 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 25 edges 20.49/9.55 [2019-03-28 12:02:32,650 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.49/9.55 [2019-03-28 12:02:32,651 INFO L263 BlockEncoder]: Using Maximize final states 20.49/9.55 [2019-03-28 12:02:32,652 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.49/9.55 [2019-03-28 12:02:32,652 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.49/9.55 [2019-03-28 12:02:32,654 INFO L296 BlockEncoder]: Using Remove sink states 20.49/9.55 [2019-03-28 12:02:32,655 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.49/9.55 [2019-03-28 12:02:32,655 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.49/9.55 [2019-03-28 12:02:32,675 INFO L185 BlockEncoder]: Using Use SBE 20.49/9.55 [2019-03-28 12:02:32,694 INFO L200 BlockEncoder]: SBE split 2 edges 20.49/9.55 [2019-03-28 12:02:32,699 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.49/9.55 [2019-03-28 12:02:32,701 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.49/9.55 [2019-03-28 12:02:32,718 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.49/9.55 [2019-03-28 12:02:32,721 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 20.49/9.55 [2019-03-28 12:02:32,722 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.49/9.55 [2019-03-28 12:02:32,722 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.49/9.55 [2019-03-28 12:02:32,723 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.49/9.55 [2019-03-28 12:02:32,723 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.49/9.55 [2019-03-28 12:02:32,724 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 21 edges 20.49/9.55 [2019-03-28 12:02:32,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32 BasicIcfg 20.49/9.55 [2019-03-28 12:02:32,724 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.49/9.55 [2019-03-28 12:02:32,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.49/9.55 [2019-03-28 12:02:32,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.49/9.55 [2019-03-28 12:02:32,729 INFO L276 PluginConnector]: TraceAbstraction initialized 20.49/9.55 [2019-03-28 12:02:32,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:02:32" (1/4) ... 20.49/9.55 [2019-03-28 12:02:32,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6194c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (2/4) ... 20.49/9.55 [2019-03-28 12:02:32,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6194c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (3/4) ... 20.49/9.55 [2019-03-28 12:02:32,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6194c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32" (4/4) ... 20.49/9.55 [2019-03-28 12:02:32,735 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.49/9.55 [2019-03-28 12:02:32,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.49/9.55 [2019-03-28 12:02:32,753 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.49/9.55 [2019-03-28 12:02:32,770 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.49/9.55 [2019-03-28 12:02:32,799 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.49/9.55 [2019-03-28 12:02:32,800 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.49/9.55 [2019-03-28 12:02:32,800 INFO L383 AbstractCegarLoop]: Hoare is true 20.49/9.55 [2019-03-28 12:02:32,800 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.49/9.55 [2019-03-28 12:02:32,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.49/9.55 [2019-03-28 12:02:32,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.49/9.55 [2019-03-28 12:02:32,800 INFO L387 AbstractCegarLoop]: Difference is false 20.49/9.55 [2019-03-28 12:02:32,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.49/9.55 [2019-03-28 12:02:32,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.49/9.55 [2019-03-28 12:02:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 20.49/9.55 [2019-03-28 12:02:32,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.49/9.55 [2019-03-28 12:02:32,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. 20.49/9.55 [2019-03-28 12:02:32,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,829 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,829 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,829 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,829 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,830 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 11 65) no Hoare annotation was computed. 20.49/9.55 [2019-03-28 12:02:32,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:32 BasicIcfg 20.49/9.55 [2019-03-28 12:02:32,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.49/9.55 [2019-03-28 12:02:32,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.49/9.55 [2019-03-28 12:02:32,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.49/9.55 [2019-03-28 12:02:32,838 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.49/9.55 [2019-03-28 12:02:32,839 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.49/9.55 [2019-03-28 12:02:32,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:02:32" (1/5) ... 20.49/9.55 [2019-03-28 12:02:32,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781c1502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.49/9.55 [2019-03-28 12:02:32,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (2/5) ... 20.49/9.55 [2019-03-28 12:02:32,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781c1502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.49/9.55 [2019-03-28 12:02:32,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (3/5) ... 20.49/9.55 [2019-03-28 12:02:32,841 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781c1502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.49/9.55 [2019-03-28 12:02:32,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32" (4/5) ... 20.49/9.55 [2019-03-28 12:02:32,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@781c1502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:32, skipping insertion in model container 20.49/9.55 [2019-03-28 12:02:32,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.49/9.55 [2019-03-28 12:02:32,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:32" (5/5) ... 20.49/9.55 [2019-03-28 12:02:32,843 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.49/9.55 [2019-03-28 12:02:32,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.49/9.55 [2019-03-28 12:02:32,871 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.49/9.55 [2019-03-28 12:02:32,871 INFO L375 BuchiCegarLoop]: Hoare is true 20.49/9.55 [2019-03-28 12:02:32,871 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.49/9.55 [2019-03-28 12:02:32,871 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.49/9.55 [2019-03-28 12:02:32,871 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.49/9.55 [2019-03-28 12:02:32,871 INFO L379 BuchiCegarLoop]: Difference is false 20.49/9.55 [2019-03-28 12:02:32,871 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.49/9.55 [2019-03-28 12:02:32,872 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.49/9.55 [2019-03-28 12:02:32,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 20.49/9.55 [2019-03-28 12:02:32,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.55 [2019-03-28 12:02:32,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.55 [2019-03-28 12:02:32,894 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.55 [2019-03-28 12:02:32,900 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.55 [2019-03-28 12:02:32,900 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.55 [2019-03-28 12:02:32,900 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.49/9.55 [2019-03-28 12:02:32,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 20.49/9.55 [2019-03-28 12:02:32,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.55 [2019-03-28 12:02:32,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.55 [2019-03-28 12:02:32,902 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.55 [2019-03-28 12:02:32,903 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.55 [2019-03-28 12:02:32,903 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.55 [2019-03-28 12:02:32,909 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [85] ULTIMATE.startENTRY-->L15: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 3#L15true [107] L15-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 10#L15-2true [91] L15-2-->L20-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 13#L20-1true [83] L20-1-->L25-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= (+ v_ULTIMATE.start_main_~x~0_11 1) v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5] 12#L25-1true [93] L25-1-->L30-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_15) (= (+ v_ULTIMATE.start_main_~x~0_15 1) v_ULTIMATE.start_main_~x~0_14)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0] 11#L30-1true [100] L30-1-->L35-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_21 (+ v_ULTIMATE.start_main_~x~0_20 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_~x~0] 9#L35-1true [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 8#L40-1true [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 7#L45-1true [103] L45-1-->L50-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_33 (+ v_ULTIMATE.start_main_~x~0_32 1)) (>= 0 v_ULTIMATE.start_main_~x~0_33)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_~x~0] 6#L50-1true [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 5#L60-1true 20.49/9.55 [2019-03-28 12:02:32,910 INFO L796 eck$LassoCheckResult]: Loop: 5#L60-1true [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 5#L60-1true 20.49/9.55 [2019-03-28 12:02:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1643076434, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:32,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:32,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.55 [2019-03-28 12:02:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.49/9.55 [2019-03-28 12:02:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.49/9.55 [2019-03-28 12:02:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.49/9.55 [2019-03-28 12:02:33,069 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.49/9.55 [2019-03-28 12:02:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:33,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.49/9.55 [2019-03-28 12:02:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.49/9.55 [2019-03-28 12:02:33,167 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. 20.49/9.55 [2019-03-28 12:02:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.49/9.55 [2019-03-28 12:02:33,260 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.49/9.55 [2019-03-28 12:02:33,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 20.49/9.55 [2019-03-28 12:02:33,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 20.49/9.55 [2019-03-28 12:02:33,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 20.49/9.55 [2019-03-28 12:02:33,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.49/9.55 [2019-03-28 12:02:33,273 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 20.49/9.55 [2019-03-28 12:02:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 20.49/9.55 [2019-03-28 12:02:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 20.49/9.55 [2019-03-28 12:02:33,303 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 20.49/9.55 [2019-03-28 12:02:33,303 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 20.49/9.55 [2019-03-28 12:02:33,303 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.49/9.55 [2019-03-28 12:02:33,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 20.49/9.55 [2019-03-28 12:02:33,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.55 [2019-03-28 12:02:33,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.55 [2019-03-28 12:02:33,305 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.55 [2019-03-28 12:02:33,307 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.55 [2019-03-28 12:02:33,307 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.55 [2019-03-28 12:02:33,308 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 39#L15 [107] L15-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 40#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 47#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 1)) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 51#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 1)) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 52#L30-1 [81] L30-1-->L35-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 46#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 45#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 44#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 43#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 42#L60-1 20.49/9.55 [2019-03-28 12:02:33,308 INFO L796 eck$LassoCheckResult]: Loop: 42#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 42#L60-1 20.49/9.55 [2019-03-28 12:02:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -203082606, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:33,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.55 [2019-03-28 12:02:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.49/9.55 [2019-03-28 12:02:33,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.49/9.55 [2019-03-28 12:02:33,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.49/9.55 [2019-03-28 12:02:33,327 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.49/9.55 [2019-03-28 12:02:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,327 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 2 times 20.49/9.55 [2019-03-28 12:02:33,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.49/9.55 [2019-03-28 12:02:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.49/9.55 [2019-03-28 12:02:33,364 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. 20.49/9.55 [2019-03-28 12:02:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.49/9.55 [2019-03-28 12:02:33,442 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.49/9.55 [2019-03-28 12:02:33,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 20.49/9.55 [2019-03-28 12:02:33,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 20.49/9.55 [2019-03-28 12:02:33,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.49/9.55 [2019-03-28 12:02:33,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.49/9.55 [2019-03-28 12:02:33,446 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. 20.49/9.55 [2019-03-28 12:02:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 20.49/9.55 [2019-03-28 12:02:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 20.49/9.55 [2019-03-28 12:02:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,449 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,449 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,449 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.49/9.55 [2019-03-28 12:02:33,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 29 transitions. 20.49/9.55 [2019-03-28 12:02:33,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.55 [2019-03-28 12:02:33,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.55 [2019-03-28 12:02:33,451 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.55 [2019-03-28 12:02:33,451 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.55 [2019-03-28 12:02:33,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.55 [2019-03-28 12:02:33,452 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 83#L15 [72] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 84#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 95#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 1)) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 96#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 1)) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 97#L30-1 [81] L30-1-->L35-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 91#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 90#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 89#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 88#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 87#L60-1 20.49/9.55 [2019-03-28 12:02:33,453 INFO L796 eck$LassoCheckResult]: Loop: 87#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 87#L60-1 20.49/9.55 [2019-03-28 12:02:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1366685841, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:33,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.55 [2019-03-28 12:02:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.49/9.55 [2019-03-28 12:02:33,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.49/9.55 [2019-03-28 12:02:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.49/9.55 [2019-03-28 12:02:33,473 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.49/9.55 [2019-03-28 12:02:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,474 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 3 times 20.49/9.55 [2019-03-28 12:02:33,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.49/9.55 [2019-03-28 12:02:33,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.49/9.55 [2019-03-28 12:02:33,527 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. 20.49/9.55 [2019-03-28 12:02:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.49/9.55 [2019-03-28 12:02:33,575 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.49/9.55 [2019-03-28 12:02:33,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 20.49/9.55 [2019-03-28 12:02:33,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 20.49/9.55 [2019-03-28 12:02:33,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.49/9.55 [2019-03-28 12:02:33,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.49/9.55 [2019-03-28 12:02:33,579 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. 20.49/9.55 [2019-03-28 12:02:33,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 20.49/9.55 [2019-03-28 12:02:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 20.49/9.55 [2019-03-28 12:02:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. 20.49/9.55 [2019-03-28 12:02:33,582 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. 20.49/9.55 [2019-03-28 12:02:33,582 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. 20.49/9.55 [2019-03-28 12:02:33,583 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.49/9.55 [2019-03-28 12:02:33,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. 20.49/9.55 [2019-03-28 12:02:33,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.55 [2019-03-28 12:02:33,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.55 [2019-03-28 12:02:33,584 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.55 [2019-03-28 12:02:33,584 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.55 [2019-03-28 12:02:33,584 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.55 [2019-03-28 12:02:33,585 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 128#L15 [72] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 129#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 137#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 1)) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 141#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 1)) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 142#L30-1 [100] L30-1-->L35-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_21 (+ v_ULTIMATE.start_main_~x~0_20 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_~x~0] 143#L35-1 [101] L35-1-->L40-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_25 (+ v_ULTIMATE.start_main_~x~0_24 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_~x~0] 144#L40-1 [102] L40-1-->L45-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_29) (= v_ULTIMATE.start_main_~x~0_29 (+ v_ULTIMATE.start_main_~x~0_28 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0] 145#L45-1 [103] L45-1-->L50-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_33 (+ v_ULTIMATE.start_main_~x~0_32 1)) (>= 0 v_ULTIMATE.start_main_~x~0_33)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_~x~0] 146#L50-1 [104] L50-1-->L60-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_37 (+ v_ULTIMATE.start_main_~x~0_36 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_37} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_36, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_~x~0] 132#L60-1 20.49/9.55 [2019-03-28 12:02:33,585 INFO L796 eck$LassoCheckResult]: Loop: 132#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 132#L60-1 20.49/9.55 [2019-03-28 12:02:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1348758824, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:33,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 4 times 20.49/9.55 [2019-03-28 12:02:33,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.55 [2019-03-28 12:02:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1138149492, now seen corresponding path program 1 times 20.49/9.55 [2019-03-28 12:02:33,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.55 [2019-03-28 12:02:33,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.55 [2019-03-28 12:02:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.55 [2019-03-28 12:02:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.55 [2019-03-28 12:02:33,783 INFO L216 LassoAnalysis]: Preferences: 20.49/9.55 [2019-03-28 12:02:33,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.49/9.55 [2019-03-28 12:02:33,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.49/9.55 [2019-03-28 12:02:33,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.49/9.55 [2019-03-28 12:02:33,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.49/9.55 [2019-03-28 12:02:33,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:33,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.49/9.55 [2019-03-28 12:02:33,785 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.49/9.55 [2019-03-28 12:02:33,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.49/9.55 [2019-03-28 12:02:33,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.49/9.55 [2019-03-28 12:02:33,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.49/9.55 [2019-03-28 12:02:33,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:33,974 INFO L300 LassoAnalysis]: Preprocessing complete. 20.49/9.55 [2019-03-28 12:02:33,975 INFO L412 LassoAnalysis]: Checking for nontermination... 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:33,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:33,987 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:33,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:33,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,029 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,064 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,068 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,102 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post10=0} Honda state: {ULTIMATE.start_main_#t~post10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,137 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,172 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,176 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,176 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post11=0} Honda state: {ULTIMATE.start_main_#t~post11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,206 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,210 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,210 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post12=0} Honda state: {ULTIMATE.start_main_#t~post12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,240 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post13=0} Honda state: {ULTIMATE.start_main_#t~post13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,274 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,308 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,313 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,313 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,342 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,373 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,377 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,406 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,409 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,439 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,471 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,475 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,475 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post14=0} Honda state: {ULTIMATE.start_main_#t~post14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,504 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,508 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.49/9.55 [2019-03-28 12:02:34,508 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post15=0} Honda state: {ULTIMATE.start_main_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,537 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.55 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.55 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.49/9.55 [2019-03-28 12:02:34,570 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.55 [2019-03-28 12:02:34,857 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.49/9.55 [2019-03-28 12:02:34,861 INFO L216 LassoAnalysis]: Preferences: 20.49/9.55 [2019-03-28 12:02:34,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.49/9.55 [2019-03-28 12:02:34,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.49/9.55 [2019-03-28 12:02:34,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.49/9.55 [2019-03-28 12:02:34,861 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.49/9.55 [2019-03-28 12:02:34,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.49/9.55 [2019-03-28 12:02:34,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.49/9.55 [2019-03-28 12:02:34,862 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.49/9.55 [2019-03-28 12:02:34,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.49/9.55 [2019-03-28 12:02:34,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.49/9.55 [2019-03-28 12:02:34,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.49/9.55 [2019-03-28 12:02:34,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:34,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.55 [2019-03-28 12:02:35,044 INFO L300 LassoAnalysis]: Preprocessing complete. 20.49/9.55 [2019-03-28 12:02:35,050 INFO L497 LassoAnalysis]: Using template 'affine'. 20.49/9.55 [2019-03-28 12:02:35,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.55 [2019-03-28 12:02:35,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.55 [2019-03-28 12:02:35,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.55 [2019-03-28 12:02:35,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.55 [2019-03-28 12:02:35,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.55 [2019-03-28 12:02:35,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.55 [2019-03-28 12:02:35,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.55 [2019-03-28 12:02:35,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.55 [2019-03-28 12:02:35,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.55 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.55 Number of strict supporting invariants: 0 20.49/9.55 Number of non-strict supporting invariants: 1 20.49/9.55 Consider only non-deceasing supporting invariants: true 20.49/9.55 Simplify termination arguments: true 20.49/9.55 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.55 [2019-03-28 12:02:35,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:35,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:35,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:35,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:35,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:35,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:35,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:35,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:35,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:35,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:35,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:35,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:35,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:35,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:35,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:35,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:35,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:35,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:35,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:35,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:35,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:35,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:35,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:35,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:35,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:35,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:35,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:35,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:35,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:35,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:35,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:35,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:35,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:35,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.49/9.56 [2019-03-28 12:02:35,158 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.49/9.56 [2019-03-28 12:02:35,158 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 20.49/9.56 [2019-03-28 12:02:35,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.49/9.56 [2019-03-28 12:02:35,163 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.49/9.56 [2019-03-28 12:02:35,164 INFO L518 LassoAnalysis]: Proved termination. 20.49/9.56 [2019-03-28 12:02:35,164 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.49/9.56 Ranking function f(ULTIMATE.start_main_~z~0) = -2*ULTIMATE.start_main_~z~0 + 207 20.49/9.56 Supporting invariants [-1*ULTIMATE.start_main_~x~0 - 9 >= 0] 20.49/9.56 [2019-03-28 12:02:35,168 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.49/9.56 [2019-03-28 12:02:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.56 [2019-03-28 12:02:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.56 [2019-03-28 12:02:35,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core 20.49/9.56 [2019-03-28 12:02:35,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.49/9.56 [2019-03-28 12:02:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.56 [2019-03-28 12:02:35,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 20.49/9.56 [2019-03-28 12:02:35,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.49/9.56 [2019-03-28 12:02:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.49/9.56 [2019-03-28 12:02:35,542 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 20.49/9.56 [2019-03-28 12:02:35,544 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates 20.49/9.56 [2019-03-28 12:02:35,545 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. 20.49/9.56 [2019-03-28 12:02:35,725 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3. Second operand 10 states. Result 21 states and 23 transitions. Complement of second has 10 states. 20.49/9.56 [2019-03-28 12:02:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states 20.49/9.56 [2019-03-28 12:02:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.49/9.56 [2019-03-28 12:02:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. 20.49/9.56 [2019-03-28 12:02:35,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. 20.49/9.56 [2019-03-28 12:02:35,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:35,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 11 letters. Loop has 1 letters. 20.49/9.56 [2019-03-28 12:02:35,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:35,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. 20.49/9.56 [2019-03-28 12:02:35,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:35,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. 20.49/9.56 [2019-03-28 12:02:35,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.56 [2019-03-28 12:02:35,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.49/9.56 [2019-03-28 12:02:35,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 20.49/9.56 [2019-03-28 12:02:35,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.49/9.56 [2019-03-28 12:02:35,739 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 20.49/9.56 [2019-03-28 12:02:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.49/9.56 [2019-03-28 12:02:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,741 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,741 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,741 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.49/9.56 [2019-03-28 12:02:35,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. 20.49/9.56 [2019-03-28 12:02:35,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 20.49/9.56 [2019-03-28 12:02:35,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.49/9.56 [2019-03-28 12:02:35,742 INFO L119 BuchiIsEmpty]: Starting construction of run 20.49/9.56 [2019-03-28 12:02:35,742 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.49/9.56 [2019-03-28 12:02:35,742 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.49/9.56 [2019-03-28 12:02:35,743 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 259#L15 [107] L15-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 260#L15-2 [91] L15-2-->L20-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 268#L20-1 [83] L20-1-->L25-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= (+ v_ULTIMATE.start_main_~x~0_11 1) v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5] 269#L25-1 [93] L25-1-->L30-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_15) (= (+ v_ULTIMATE.start_main_~x~0_15 1) v_ULTIMATE.start_main_~x~0_14)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0] 267#L30-1 [81] L30-1-->L35-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 266#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 265#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 264#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 263#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 262#L60-1 20.49/9.56 [2019-03-28 12:02:35,743 INFO L796 eck$LassoCheckResult]: Loop: 262#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 262#L60-1 20.49/9.56 [2019-03-28 12:02:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.56 [2019-03-28 12:02:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1625529039, now seen corresponding path program 1 times 20.49/9.56 [2019-03-28 12:02:35,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.56 [2019-03-28 12:02:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.56 [2019-03-28 12:02:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.56 [2019-03-28 12:02:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 5 times 20.49/9.56 [2019-03-28 12:02:35,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.56 [2019-03-28 12:02:35,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.56 [2019-03-28 12:02:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.56 [2019-03-28 12:02:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1148207267, now seen corresponding path program 1 times 20.49/9.56 [2019-03-28 12:02:35,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.49/9.56 [2019-03-28 12:02:35,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.49/9.56 [2019-03-28 12:02:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.49/9.56 [2019-03-28 12:02:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.49/9.56 [2019-03-28 12:02:35,890 INFO L216 LassoAnalysis]: Preferences: 20.49/9.56 [2019-03-28 12:02:35,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.49/9.56 [2019-03-28 12:02:35,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.49/9.56 [2019-03-28 12:02:35,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.49/9.56 [2019-03-28 12:02:35,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.49/9.56 [2019-03-28 12:02:35,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.56 [2019-03-28 12:02:35,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.49/9.56 [2019-03-28 12:02:35,891 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.49/9.56 [2019-03-28 12:02:35,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.49/9.56 [2019-03-28 12:02:35,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.49/9.56 [2019-03-28 12:02:35,892 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.49/9.56 [2019-03-28 12:02:35,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:35,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,005 INFO L300 LassoAnalysis]: Preprocessing complete. 20.49/9.56 [2019-03-28 12:02:36,005 INFO L412 LassoAnalysis]: Checking for nontermination... 20.49/9.56 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.56 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.56 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.56 [2019-03-28 12:02:36,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.49/9.56 [2019-03-28 12:02:36,014 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.56 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.49/9.56 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.49/9.56 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.49/9.56 [2019-03-28 12:02:36,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.49/9.56 [2019-03-28 12:02:36,048 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.49/9.56 [2019-03-28 12:02:36,441 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.49/9.56 [2019-03-28 12:02:36,444 INFO L216 LassoAnalysis]: Preferences: 20.49/9.56 [2019-03-28 12:02:36,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.49/9.56 [2019-03-28 12:02:36,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.49/9.56 [2019-03-28 12:02:36,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.49/9.56 [2019-03-28 12:02:36,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.49/9.56 [2019-03-28 12:02:36,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.49/9.56 [2019-03-28 12:02:36,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.49/9.56 [2019-03-28 12:02:36,445 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.49/9.56 [2019-03-28 12:02:36,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.49/9.56 [2019-03-28 12:02:36,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.49/9.56 [2019-03-28 12:02:36,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.49/9.56 [2019-03-28 12:02:36,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.49/9.56 [2019-03-28 12:02:36,554 INFO L300 LassoAnalysis]: Preprocessing complete. 20.49/9.56 [2019-03-28 12:02:36,554 INFO L497 LassoAnalysis]: Using template 'affine'. 20.49/9.56 [2019-03-28 12:02:36,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:36,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:36,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:36,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:36,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:36,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:36,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:36,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:36,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:36,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:36,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:36,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:36,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:36,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:36,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:36,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:36,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:36,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:36,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:36,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:36,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.49/9.56 [2019-03-28 12:02:36,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:36,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:36,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:36,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:36,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:36,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.49/9.56 [2019-03-28 12:02:36,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.49/9.56 Termination analysis: LINEAR_WITH_GUESSES 20.49/9.56 Number of strict supporting invariants: 0 20.49/9.56 Number of non-strict supporting invariants: 1 20.49/9.56 Consider only non-deceasing supporting invariants: true 20.49/9.56 Simplify termination arguments: true 20.49/9.56 Simplify supporting invariants: trueOverapproximate stem: false 20.49/9.56 [2019-03-28 12:02:36,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.49/9.56 [2019-03-28 12:02:36,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.49/9.56 [2019-03-28 12:02:36,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.49/9.56 [2019-03-28 12:02:36,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.49/9.56 [2019-03-28 12:02:36,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.49/9.56 [2019-03-28 12:02:36,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.49/9.56 [2019-03-28 12:02:36,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.49/9.56 [2019-03-28 12:02:36,589 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.49/9.56 [2019-03-28 12:02:36,589 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 20.49/9.56 [2019-03-28 12:02:36,590 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.49/9.56 [2019-03-28 12:02:36,591 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.49/9.56 [2019-03-28 12:02:36,592 INFO L518 LassoAnalysis]: Proved termination. 20.49/9.56 [2019-03-28 12:02:36,592 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.49/9.56 Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 207 20.49/9.56 Supporting invariants [1*ULTIMATE.start_main_~x~0 - 9 >= 0] 20.49/9.56 [2019-03-28 12:02:36,596 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.49/9.56 [2019-03-28 12:02:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.49/9.56 [2019-03-28 12:02:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.56 [2019-03-28 12:02:36,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core 20.49/9.56 [2019-03-28 12:02:36,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.49/9.56 [2019-03-28 12:02:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.49/9.56 [2019-03-28 12:02:36,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 20.49/9.56 [2019-03-28 12:02:36,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.49/9.56 [2019-03-28 12:02:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.49/9.56 [2019-03-28 12:02:36,820 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 20.49/9.56 [2019-03-28 12:02:36,820 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates 20.49/9.56 [2019-03-28 12:02:36,820 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. 20.49/9.56 [2019-03-28 12:02:36,948 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 12 states and 13 transitions. Complement of second has 10 states. 20.49/9.56 [2019-03-28 12:02:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states 20.49/9.56 [2019-03-28 12:02:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 1 letters. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:36,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. 20.49/9.56 [2019-03-28 12:02:36,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.49/9.56 [2019-03-28 12:02:36,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. 20.49/9.56 [2019-03-28 12:02:36,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.49/9.56 [2019-03-28 12:02:36,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.49/9.56 [2019-03-28 12:02:36,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.49/9.56 [2019-03-28 12:02:36,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.49/9.56 [2019-03-28 12:02:36,953 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,953 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,953 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,953 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.49/9.56 [2019-03-28 12:02:36,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.49/9.56 [2019-03-28 12:02:36,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.49/9.56 [2019-03-28 12:02:36,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.49/9.56 [2019-03-28 12:02:36,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:36 BasicIcfg 20.49/9.56 [2019-03-28 12:02:36,960 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.49/9.56 [2019-03-28 12:02:36,960 INFO L168 Benchmark]: Toolchain (without parser) took 4949.51 ms. Allocated memory was 649.6 MB in the beginning and 738.2 MB in the end (delta: 88.6 MB). Free memory was 564.9 MB in the beginning and 416.9 MB in the end (delta: 148.0 MB). Peak memory consumption was 236.6 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,962 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.76 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 553.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.78 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 553.8 MB in the beginning and 619.5 MB in the end (delta: -65.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,964 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 ms. Allocated memory is still 652.7 MB. Free memory was 619.5 MB in the beginning and 616.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,964 INFO L168 Benchmark]: RCFGBuilder took 248.74 ms. Allocated memory is still 652.7 MB. Free memory was 616.6 MB in the beginning and 598.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,965 INFO L168 Benchmark]: BlockEncodingV2 took 95.29 ms. Allocated memory is still 652.7 MB. Free memory was 598.5 MB in the beginning and 592.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,965 INFO L168 Benchmark]: TraceAbstraction took 108.53 ms. Allocated memory is still 652.7 MB. Free memory was 592.0 MB in the beginning and 584.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,966 INFO L168 Benchmark]: BuchiAutomizer took 4125.40 ms. Allocated memory was 652.7 MB in the beginning and 738.2 MB in the end (delta: 85.5 MB). Free memory was 584.5 MB in the beginning and 416.9 MB in the end (delta: 167.6 MB). Peak memory consumption was 253.1 MB. Max. memory is 50.3 GB. 20.49/9.56 [2019-03-28 12:02:36,970 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.49/9.56 --- Results --- 20.49/9.56 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.49/9.56 - StatisticsResult: Initial Icfg 20.49/9.56 15 locations, 25 edges 20.49/9.56 - StatisticsResult: Encoded RCFG 20.49/9.56 11 locations, 21 edges 20.49/9.56 * Results from de.uni_freiburg.informatik.ultimate.core: 20.49/9.56 - StatisticsResult: Toolchain Benchmarks 20.49/9.56 Benchmark results are: 20.49/9.56 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.49/9.56 * CACSL2BoogieTranslator took 241.76 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 553.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 50.3 GB. 20.49/9.56 * Boogie Procedure Inliner took 100.78 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 553.8 MB in the beginning and 619.5 MB in the end (delta: -65.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 20.49/9.56 * Boogie Preprocessor took 23.56 ms. Allocated memory is still 652.7 MB. Free memory was 619.5 MB in the beginning and 616.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 20.49/9.56 * RCFGBuilder took 248.74 ms. Allocated memory is still 652.7 MB. Free memory was 616.6 MB in the beginning and 598.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 20.49/9.56 * BlockEncodingV2 took 95.29 ms. Allocated memory is still 652.7 MB. Free memory was 598.5 MB in the beginning and 592.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 20.49/9.56 * TraceAbstraction took 108.53 ms. Allocated memory is still 652.7 MB. Free memory was 592.0 MB in the beginning and 584.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. 20.49/9.56 * BuchiAutomizer took 4125.40 ms. Allocated memory was 652.7 MB in the beginning and 738.2 MB in the end (delta: 85.5 MB). Free memory was 584.5 MB in the beginning and 416.9 MB in the end (delta: 167.6 MB). Peak memory consumption was 253.1 MB. Max. memory is 50.3 GB. 20.49/9.56 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.49/9.56 - AllSpecificationsHoldResult: All specifications hold 20.49/9.56 We were not able to verify any specifiation because the program does not contain any specification. 20.49/9.56 - StatisticsResult: Ultimate Automizer benchmark data 20.49/9.56 CFG has 1 procedures, 11 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=11occurred 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, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 20.49/9.56 - StatisticsResult: Constructed decomposition of program 20.49/9.56 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * z + 207 and consists of 10 locations. One nondeterministic module has affine ranking function -2 * y + 207 and consists of 10 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. 20.49/9.56 - StatisticsResult: Timing statistics 20.49/9.56 BüchiAutomizer plugin needed 4.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 28 SDslu, 0 SDs, 0 SdLazy, 157 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf94 smp100 dnf100 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 20.49/9.56 - TerminationAnalysisResult: Termination proven 20.49/9.56 Buchi Automizer proved that your program is terminating 20.49/9.56 RESULT: Ultimate proved your program to be correct! 20.49/9.56 !SESSION 2019-03-28 12:02:28.655 ----------------------------------------------- 20.49/9.56 eclipse.buildId=unknown 20.49/9.56 java.version=1.8.0_181 20.49/9.56 java.vendor=Oracle Corporation 20.49/9.56 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.49/9.56 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.49/9.56 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.49/9.56 20.49/9.56 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:02:37.202 20.49/9.56 !MESSAGE The workspace will exit with unsaved changes in this session. 20.49/9.56 Received shutdown request... 20.49/9.56 Ultimate: 20.49/9.56 GTK+ Version Check 20.49/9.56 EOF