18.81/9.31 YES 18.81/9.31 18.81/9.31 Ultimate: Cannot open display: 18.81/9.31 This is Ultimate 0.1.24-8dc7c08-m 18.81/9.31 [2019-03-29 01:53:30,238 INFO L170 SettingsManager]: Resetting all preferences to default values... 18.81/9.31 [2019-03-29 01:53:30,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 18.81/9.31 [2019-03-29 01:53:30,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 18.81/9.31 [2019-03-29 01:53:30,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 18.81/9.31 [2019-03-29 01:53:30,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 18.81/9.31 [2019-03-29 01:53:30,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 18.81/9.31 [2019-03-29 01:53:30,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 18.81/9.31 [2019-03-29 01:53:30,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 18.81/9.31 [2019-03-29 01:53:30,259 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 18.81/9.31 [2019-03-29 01:53:30,260 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 18.81/9.31 [2019-03-29 01:53:30,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 18.81/9.31 [2019-03-29 01:53:30,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 18.81/9.31 [2019-03-29 01:53:30,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 18.81/9.31 [2019-03-29 01:53:30,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 18.81/9.31 [2019-03-29 01:53:30,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 18.81/9.31 [2019-03-29 01:53:30,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 18.81/9.31 [2019-03-29 01:53:30,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 18.81/9.31 [2019-03-29 01:53:30,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 18.81/9.31 [2019-03-29 01:53:30,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 18.81/9.31 [2019-03-29 01:53:30,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 18.81/9.31 [2019-03-29 01:53:30,275 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 18.81/9.31 [2019-03-29 01:53:30,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 18.81/9.31 [2019-03-29 01:53:30,276 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 18.81/9.31 [2019-03-29 01:53:30,277 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 18.81/9.31 [2019-03-29 01:53:30,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 18.81/9.31 [2019-03-29 01:53:30,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 18.81/9.31 [2019-03-29 01:53:30,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 18.81/9.31 [2019-03-29 01:53:30,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,280 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 18.81/9.31 [2019-03-29 01:53:30,280 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 18.81/9.31 [2019-03-29 01:53:30,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 18.81/9.31 [2019-03-29 01:53:30,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 18.81/9.31 [2019-03-29 01:53:30,282 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 18.81/9.31 [2019-03-29 01:53:30,297 INFO L110 SettingsManager]: Loading preferences was successful 18.81/9.31 [2019-03-29 01:53:30,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 18.81/9.31 [2019-03-29 01:53:30,298 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 18.81/9.31 [2019-03-29 01:53:30,298 INFO L133 SettingsManager]: * Rewrite not-equals=true 18.81/9.31 [2019-03-29 01:53:30,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 18.81/9.31 [2019-03-29 01:53:30,298 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 18.81/9.31 [2019-03-29 01:53:30,299 INFO L133 SettingsManager]: * Use SBE=true 18.81/9.31 [2019-03-29 01:53:30,299 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 18.81/9.31 [2019-03-29 01:53:30,299 INFO L133 SettingsManager]: * Use old map elimination=false 18.81/9.31 [2019-03-29 01:53:30,299 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 18.81/9.31 [2019-03-29 01:53:30,299 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 18.81/9.31 [2019-03-29 01:53:30,299 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 18.81/9.31 [2019-03-29 01:53:30,300 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 18.81/9.31 [2019-03-29 01:53:30,300 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 18.81/9.31 [2019-03-29 01:53:30,300 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:30,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 18.81/9.31 [2019-03-29 01:53:30,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 18.81/9.31 [2019-03-29 01:53:30,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE 18.81/9.31 [2019-03-29 01:53:30,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 18.81/9.31 [2019-03-29 01:53:30,301 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 18.81/9.31 [2019-03-29 01:53:30,301 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 18.81/9.31 [2019-03-29 01:53:30,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 18.81/9.31 [2019-03-29 01:53:30,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 18.81/9.31 [2019-03-29 01:53:30,301 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 18.81/9.31 [2019-03-29 01:53:30,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.81/9.31 [2019-03-29 01:53:30,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 18.81/9.31 [2019-03-29 01:53:30,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 18.81/9.31 [2019-03-29 01:53:30,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 18.81/9.31 [2019-03-29 01:53:30,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 18.81/9.31 [2019-03-29 01:53:30,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 18.81/9.31 [2019-03-29 01:53:30,341 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 18.81/9.31 [2019-03-29 01:53:30,344 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 18.81/9.31 [2019-03-29 01:53:30,346 INFO L271 PluginConnector]: Initializing CDTParser... 18.81/9.31 [2019-03-29 01:53:30,346 INFO L276 PluginConnector]: CDTParser initialized 18.81/9.31 [2019-03-29 01:53:30,347 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 18.81/9.31 [2019-03-29 01:53:30,409 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8da4f197225f40d4b87eb58214062d29/FLAGd852cfc16 18.81/9.31 [2019-03-29 01:53:30,749 INFO L307 CDTParser]: Found 1 translation units. 18.81/9.31 [2019-03-29 01:53:30,750 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 18.81/9.31 [2019-03-29 01:53:30,757 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8da4f197225f40d4b87eb58214062d29/FLAGd852cfc16 18.81/9.31 [2019-03-29 01:53:31,156 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8da4f197225f40d4b87eb58214062d29 18.81/9.31 [2019-03-29 01:53:31,168 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 18.81/9.31 [2019-03-29 01:53:31,171 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 18.81/9.31 [2019-03-29 01:53:31,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 18.81/9.31 [2019-03-29 01:53:31,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 18.81/9.31 [2019-03-29 01:53:31,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 18.81/9.31 [2019-03-29 01:53:31,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce8a0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 18.81/9.31 [2019-03-29 01:53:31,209 INFO L176 MainTranslator]: Built tables and reachable declarations 18.81/9.31 [2019-03-29 01:53:31,375 INFO L206 PostProcessor]: Analyzing one entry point: main 18.81/9.31 [2019-03-29 01:53:31,380 INFO L191 MainTranslator]: Completed pre-run 18.81/9.31 [2019-03-29 01:53:31,399 INFO L206 PostProcessor]: Analyzing one entry point: main 18.81/9.31 [2019-03-29 01:53:31,415 INFO L195 MainTranslator]: Completed translation 18.81/9.31 [2019-03-29 01:53:31,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31 WrapperNode 18.81/9.31 [2019-03-29 01:53:31,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 18.81/9.31 [2019-03-29 01:53:31,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 18.81/9.31 [2019-03-29 01:53:31,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 18.81/9.31 [2019-03-29 01:53:31,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 18.81/9.31 [2019-03-29 01:53:31,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 18.81/9.31 [2019-03-29 01:53:31,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 18.81/9.31 [2019-03-29 01:53:31,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 18.81/9.31 [2019-03-29 01:53:31,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized 18.81/9.31 [2019-03-29 01:53:31,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 18.81/9.31 [2019-03-29 01:53:31,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 18.81/9.31 [2019-03-29 01:53:31,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... 18.81/9.31 [2019-03-29 01:53:31,535 INFO L276 PluginConnector]: RCFGBuilder initialized 18.81/9.31 [2019-03-29 01:53:31,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (1/1) ... 18.81/9.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.31 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 18.81/9.31 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.81/9.31 [2019-03-29 01:53:31,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 18.81/9.31 [2019-03-29 01:53:31,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 18.81/9.31 [2019-03-29 01:53:31,750 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 18.81/9.31 [2019-03-29 01:53:31,750 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 18.81/9.31 [2019-03-29 01:53:31,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:31 BoogieIcfgContainer 18.81/9.31 [2019-03-29 01:53:31,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 18.81/9.31 [2019-03-29 01:53:31,752 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 18.81/9.31 [2019-03-29 01:53:31,752 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 18.81/9.31 [2019-03-29 01:53:31,754 INFO L276 PluginConnector]: BlockEncodingV2 initialized 18.81/9.31 [2019-03-29 01:53:31,755 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:31" (1/1) ... 18.81/9.31 [2019-03-29 01:53:31,770 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges 18.81/9.31 [2019-03-29 01:53:31,772 INFO L258 BlockEncoder]: Using Remove infeasible edges 18.81/9.31 [2019-03-29 01:53:31,773 INFO L263 BlockEncoder]: Using Maximize final states 18.81/9.31 [2019-03-29 01:53:31,774 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 18.81/9.31 [2019-03-29 01:53:31,774 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 18.81/9.31 [2019-03-29 01:53:31,776 INFO L296 BlockEncoder]: Using Remove sink states 18.81/9.31 [2019-03-29 01:53:31,777 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 18.81/9.31 [2019-03-29 01:53:31,777 INFO L179 BlockEncoder]: Using Rewrite not-equals 18.81/9.31 [2019-03-29 01:53:31,794 INFO L185 BlockEncoder]: Using Use SBE 18.81/9.31 [2019-03-29 01:53:31,815 INFO L200 BlockEncoder]: SBE split 6 edges 18.81/9.31 [2019-03-29 01:53:31,819 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 18.81/9.31 [2019-03-29 01:53:31,821 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.81/9.31 [2019-03-29 01:53:31,831 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 18.81/9.31 [2019-03-29 01:53:31,833 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 18.81/9.31 [2019-03-29 01:53:31,835 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.81/9.31 [2019-03-29 01:53:31,835 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.81/9.31 [2019-03-29 01:53:31,835 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 18.81/9.31 [2019-03-29 01:53:31,836 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.81/9.31 [2019-03-29 01:53:31,836 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 16 edges 18.81/9.31 [2019-03-29 01:53:31,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:31 BasicIcfg 18.81/9.31 [2019-03-29 01:53:31,837 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 18.81/9.31 [2019-03-29 01:53:31,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 18.81/9.31 [2019-03-29 01:53:31,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... 18.81/9.31 [2019-03-29 01:53:31,841 INFO L276 PluginConnector]: TraceAbstraction initialized 18.81/9.31 [2019-03-29 01:53:31,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:53:31" (1/4) ... 18.81/9.31 [2019-03-29 01:53:31,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (2/4) ... 18.81/9.31 [2019-03-29 01:53:31,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:31" (3/4) ... 18.81/9.31 [2019-03-29 01:53:31,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33efaa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:31" (4/4) ... 18.81/9.31 [2019-03-29 01:53:31,845 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.81/9.31 [2019-03-29 01:53:31,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 18.81/9.31 [2019-03-29 01:53:31,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 18.81/9.31 [2019-03-29 01:53:31,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 18.81/9.31 [2019-03-29 01:53:31,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.81/9.31 [2019-03-29 01:53:31,910 INFO L382 AbstractCegarLoop]: Interprodecural is true 18.81/9.31 [2019-03-29 01:53:31,910 INFO L383 AbstractCegarLoop]: Hoare is true 18.81/9.31 [2019-03-29 01:53:31,910 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 18.81/9.31 [2019-03-29 01:53:31,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 18.81/9.31 [2019-03-29 01:53:31,911 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.81/9.31 [2019-03-29 01:53:31,911 INFO L387 AbstractCegarLoop]: Difference is false 18.81/9.31 [2019-03-29 01:53:31,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 18.81/9.31 [2019-03-29 01:53:31,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 18.81/9.31 [2019-03-29 01:53:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 18.81/9.31 [2019-03-29 01:53:31,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 18.81/9.31 [2019-03-29 01:53:31,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 18.81/9.31 [2019-03-29 01:53:31,983 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 18.81/9.31 [2019-03-29 01:53:31,984 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. 18.81/9.31 [2019-03-29 01:53:31,984 INFO L451 ceAbstractionStarter]: At program point L28-2(lines 19 31) the Hoare annotation is: true 18.81/9.31 [2019-03-29 01:53:31,984 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. 18.81/9.31 [2019-03-29 01:53:31,984 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 25) no Hoare annotation was computed. 18.81/9.31 [2019-03-29 01:53:31,984 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 30) no Hoare annotation was computed. 18.81/9.31 [2019-03-29 01:53:31,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:31 BasicIcfg 18.81/9.31 [2019-03-29 01:53:31,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 18.81/9.31 [2019-03-29 01:53:31,993 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 18.81/9.31 [2019-03-29 01:53:31,994 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 18.81/9.31 [2019-03-29 01:53:31,997 INFO L276 PluginConnector]: BuchiAutomizer initialized 18.81/9.31 [2019-03-29 01:53:31,998 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.81/9.31 [2019-03-29 01:53:31,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:53:31" (1/5) ... 18.81/9.31 [2019-03-29 01:53:31,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@712830e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.81/9.31 [2019-03-29 01:53:31,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:53:31" (2/5) ... 18.81/9.31 [2019-03-29 01:53:31,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@712830e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:53:31, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:31,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.81/9.31 [2019-03-29 01:53:31,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:53:31" (3/5) ... 18.81/9.31 [2019-03-29 01:53:32,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@712830e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:32, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:32,000 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.81/9.31 [2019-03-29 01:53:32,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:53:31" (4/5) ... 18.81/9.31 [2019-03-29 01:53:32,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@712830e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:32, skipping insertion in model container 18.81/9.31 [2019-03-29 01:53:32,001 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.81/9.31 [2019-03-29 01:53:32,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:53:31" (5/5) ... 18.81/9.31 [2019-03-29 01:53:32,002 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.81/9.31 [2019-03-29 01:53:32,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.81/9.31 [2019-03-29 01:53:32,030 INFO L374 BuchiCegarLoop]: Interprodecural is true 18.81/9.31 [2019-03-29 01:53:32,030 INFO L375 BuchiCegarLoop]: Hoare is true 18.81/9.31 [2019-03-29 01:53:32,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 18.81/9.31 [2019-03-29 01:53:32,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 18.81/9.31 [2019-03-29 01:53:32,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.81/9.31 [2019-03-29 01:53:32,031 INFO L379 BuchiCegarLoop]: Difference is false 18.81/9.31 [2019-03-29 01:53:32,031 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 18.81/9.31 [2019-03-29 01:53:32,031 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 18.81/9.31 [2019-03-29 01:53:32,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 18.81/9.31 [2019-03-29 01:53:32,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 18.81/9.31 [2019-03-29 01:53:32,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.31 [2019-03-29 01:53:32,054 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.31 [2019-03-29 01:53:32,061 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.81/9.31 [2019-03-29 01:53:32,061 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 18.81/9.31 [2019-03-29 01:53:32,061 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 18.81/9.31 [2019-03-29 01:53:32,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 18.81/9.31 [2019-03-29 01:53:32,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 18.81/9.31 [2019-03-29 01:53:32,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.31 [2019-03-29 01:53:32,062 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.31 [2019-03-29 01:53:32,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.81/9.31 [2019-03-29 01:53:32,063 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 18.81/9.31 [2019-03-29 01:53:32,068 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 3#L28-2true 18.81/9.31 [2019-03-29 01:53:32,069 INFO L796 eck$LassoCheckResult]: Loop: 3#L28-2true [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 8#L20true [66] L20-->L26: Formula: (> v_ULTIMATE.start_main_~j~0_11 v_ULTIMATE.start_main_~bn~0_9) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} AuxVars[] AssignedVars[] 4#L26true [43] L26-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~an~0_10) (<= v_ULTIMATE.start_main_~bn~0_10 v_ULTIMATE.start_main_~j~0_12) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3#L28-2true 18.81/9.31 [2019-03-29 01:53:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.31 [2019-03-29 01:53:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times 18.81/9.31 [2019-03-29 01:53:32,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.31 [2019-03-29 01:53:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.31 [2019-03-29 01:53:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.31 [2019-03-29 01:53:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash 89540, now seen corresponding path program 1 times 18.81/9.31 [2019-03-29 01:53:32,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.31 [2019-03-29 01:53:32,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.31 [2019-03-29 01:53:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.31 [2019-03-29 01:53:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2383447, now seen corresponding path program 1 times 18.81/9.31 [2019-03-29 01:53:32,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.31 [2019-03-29 01:53:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.31 [2019-03-29 01:53:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.31 [2019-03-29 01:53:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.31 [2019-03-29 01:53:32,234 INFO L216 LassoAnalysis]: Preferences: 18.81/9.31 [2019-03-29 01:53:32,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.31 [2019-03-29 01:53:32,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.31 [2019-03-29 01:53:32,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.31 [2019-03-29 01:53:32,236 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.81/9.31 [2019-03-29 01:53:32,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.31 [2019-03-29 01:53:32,236 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.31 [2019-03-29 01:53:32,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 18.81/9.31 [2019-03-29 01:53:32,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.31 [2019-03-29 01:53:32,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.31 [2019-03-29 01:53:32,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,365 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.31 [2019-03-29 01:53:32,366 INFO L412 LassoAnalysis]: Checking for nontermination... 18.81/9.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.31 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.31 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.31 [2019-03-29 01:53:32,374 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.31 [2019-03-29 01:53:32,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.81/9.31 [2019-03-29 01:53:32,408 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 18.81/9.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.31 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.31 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.31 [2019-03-29 01:53:32,415 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.31 [2019-03-29 01:53:32,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.81/9.31 [2019-03-29 01:53:32,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 18.81/9.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.31 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.31 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.31 [2019-03-29 01:53:32,449 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.31 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.31 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.81/9.31 [2019-03-29 01:53:32,481 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.31 [2019-03-29 01:53:32,652 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.81/9.31 [2019-03-29 01:53:32,654 INFO L216 LassoAnalysis]: Preferences: 18.81/9.31 [2019-03-29 01:53:32,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.31 [2019-03-29 01:53:32,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.31 [2019-03-29 01:53:32,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.31 [2019-03-29 01:53:32,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.81/9.31 [2019-03-29 01:53:32,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.81/9.31 [2019-03-29 01:53:32,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.31 [2019-03-29 01:53:32,655 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.31 [2019-03-29 01:53:32,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 18.81/9.31 [2019-03-29 01:53:32,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.31 [2019-03-29 01:53:32,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.31 [2019-03-29 01:53:32,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.31 [2019-03-29 01:53:32,740 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.31 [2019-03-29 01:53:32,746 INFO L497 LassoAnalysis]: Using template 'affine'. 18.81/9.31 [2019-03-29 01:53:32,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.81/9.31 Termination analysis: LINEAR_WITH_GUESSES 18.81/9.31 Number of strict supporting invariants: 0 18.81/9.31 Number of non-strict supporting invariants: 1 18.81/9.31 Consider only non-deceasing supporting invariants: true 18.81/9.31 Simplify termination arguments: true 18.81/9.31 Simplify supporting invariants: trueOverapproximate stem: false 18.81/9.31 [2019-03-29 01:53:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.81/9.31 [2019-03-29 01:53:32,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.81/9.31 [2019-03-29 01:53:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.81/9.31 [2019-03-29 01:53:32,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.81/9.31 [2019-03-29 01:53:32,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.81/9.31 [2019-03-29 01:53:32,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.81/9.31 [2019-03-29 01:53:32,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.81/9.31 [2019-03-29 01:53:32,761 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.81/9.31 [2019-03-29 01:53:32,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.81/9.31 [2019-03-29 01:53:32,769 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 18.81/9.31 [2019-03-29 01:53:32,771 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.81/9.31 [2019-03-29 01:53:32,771 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.81/9.31 [2019-03-29 01:53:32,772 INFO L518 LassoAnalysis]: Proved termination. 18.81/9.31 [2019-03-29 01:53:32,773 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.81/9.31 Ranking function f(ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~an~0 - 2*ULTIMATE.start_main_~i~0 + 1 18.81/9.31 Supporting invariants [] 18.81/9.31 [2019-03-29 01:53:32,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.81/9.31 [2019-03-29 01:53:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.31 [2019-03-29 01:53:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.31 [2019-03-29 01:53:32,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 18.81/9.31 [2019-03-29 01:53:32,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.31 [2019-03-29 01:53:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.31 [2019-03-29 01:53:32,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.31 [2019-03-29 01:53:32,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.31 [2019-03-29 01:53:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.81/9.31 [2019-03-29 01:53:32,913 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 18.81/9.31 [2019-03-29 01:53:32,919 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 18.81/9.31 [2019-03-29 01:53:32,920 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. 18.81/9.31 [2019-03-29 01:53:33,027 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 28 states and 82 transitions. Complement of second has 7 states. 18.81/9.31 [2019-03-29 01:53:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 18.81/9.31 [2019-03-29 01:53:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 18.81/9.31 [2019-03-29 01:53:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. 18.81/9.31 [2019-03-29 01:53:33,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 1 letters. Loop has 3 letters. 18.81/9.31 [2019-03-29 01:53:33,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.31 [2019-03-29 01:53:33,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 3 letters. 18.81/9.31 [2019-03-29 01:53:33,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.31 [2019-03-29 01:53:33,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 1 letters. Loop has 6 letters. 18.81/9.31 [2019-03-29 01:53:33,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.31 [2019-03-29 01:53:33,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 82 transitions. 18.81/9.31 [2019-03-29 01:53:33,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.31 [2019-03-29 01:53:33,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 65 transitions. 18.81/9.31 [2019-03-29 01:53:33,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 18.81/9.31 [2019-03-29 01:53:33,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 18.81/9.31 [2019-03-29 01:53:33,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 65 transitions. 18.81/9.31 [2019-03-29 01:53:33,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.81/9.31 [2019-03-29 01:53:33,053 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 65 transitions. 18.81/9.31 [2019-03-29 01:53:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 65 transitions. 18.81/9.31 [2019-03-29 01:53:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. 18.81/9.31 [2019-03-29 01:53:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 18.81/9.31 [2019-03-29 01:53:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. 18.81/9.31 [2019-03-29 01:53:33,085 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 60 transitions. 18.81/9.31 [2019-03-29 01:53:33,085 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 60 transitions. 18.81/9.31 [2019-03-29 01:53:33,086 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 18.81/9.31 [2019-03-29 01:53:33,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 60 transitions. 18.81/9.31 [2019-03-29 01:53:33,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.31 [2019-03-29 01:53:33,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.31 [2019-03-29 01:53:33,087 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.31 [2019-03-29 01:53:33,088 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 18.81/9.31 [2019-03-29 01:53:33,088 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 18.81/9.31 [2019-03-29 01:53:33,088 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 88#L28-2 [62] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 75#L20 18.81/9.31 [2019-03-29 01:53:33,088 INFO L796 eck$LassoCheckResult]: Loop: 75#L20 [53] L20-->L21: Formula: (and (<= v_ULTIMATE.start_main_~i~0_8 v_ULTIMATE.start_main_~an~0_8) (<= v_ULTIMATE.start_main_~j~0_8 v_ULTIMATE.start_main_~bn~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[] 84#L21 [68] L21-->L28-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_9 (+ v_ULTIMATE.start_main_~j~0_10 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 85#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 75#L20 18.81/9.31 [2019-03-29 01:53:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.31 [2019-03-29 01:53:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2480, now seen corresponding path program 1 times 18.81/9.31 [2019-03-29 01:53:33,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.31 [2019-03-29 01:53:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.31 [2019-03-29 01:53:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash 82892, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:33,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:33,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:33,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash 73934781, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:33,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:33,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:33,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:33,144 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:33,145 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:33,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:33,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:33,145 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.81/9.32 [2019-03-29 01:53:33,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:33,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:33,145 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:33,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 18.81/9.32 [2019-03-29 01:53:33,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:33,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:33,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,213 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:33,213 INFO L412 LassoAnalysis]: Checking for nontermination... 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:33,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:33,219 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:33,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.81/9.32 [2019-03-29 01:53:33,248 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:33,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:33,257 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:33,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:33,290 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:33,715 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.81/9.32 [2019-03-29 01:53:33,718 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:33,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:33,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:33,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:33,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.81/9.32 [2019-03-29 01:53:33,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:33,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:33,719 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:33,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 18.81/9.32 [2019-03-29 01:53:33,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:33,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:33,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:33,791 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:33,792 INFO L497 LassoAnalysis]: Using template 'affine'. 18.81/9.32 [2019-03-29 01:53:33,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.81/9.32 Termination analysis: LINEAR_WITH_GUESSES 18.81/9.32 Number of strict supporting invariants: 0 18.81/9.32 Number of non-strict supporting invariants: 1 18.81/9.32 Consider only non-deceasing supporting invariants: true 18.81/9.32 Simplify termination arguments: true 18.81/9.32 Simplify supporting invariants: trueOverapproximate stem: false 18.81/9.32 [2019-03-29 01:53:33,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.81/9.32 [2019-03-29 01:53:33,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.81/9.32 [2019-03-29 01:53:33,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.81/9.32 [2019-03-29 01:53:33,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.81/9.32 [2019-03-29 01:53:33,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.81/9.32 [2019-03-29 01:53:33,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.81/9.32 [2019-03-29 01:53:33,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.81/9.32 [2019-03-29 01:53:33,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.81/9.32 [2019-03-29 01:53:33,805 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.81/9.32 [2019-03-29 01:53:33,805 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 18.81/9.32 [2019-03-29 01:53:33,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.81/9.32 [2019-03-29 01:53:33,806 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.81/9.32 [2019-03-29 01:53:33,806 INFO L518 LassoAnalysis]: Proved termination. 18.81/9.32 [2019-03-29 01:53:33,806 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.81/9.32 Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~bn~0 - 2*ULTIMATE.start_main_~j~0 + 1 18.81/9.32 Supporting invariants [] 18.81/9.32 [2019-03-29 01:53:33,807 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.81/9.32 [2019-03-29 01:53:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:33,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:33,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:33,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.81/9.32 [2019-03-29 01:53:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:33,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:33,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:33,906 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 18.81/9.32 [2019-03-29 01:53:33,906 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 18.81/9.32 [2019-03-29 01:53:33,906 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 60 transitions. cyclomatic complexity: 42 Second operand 4 states. 18.81/9.32 [2019-03-29 01:53:34,045 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 60 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 161 states and 420 transitions. Complement of second has 19 states. 18.81/9.32 [2019-03-29 01:53:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 2 non-accepting loop states 2 accepting loop states 18.81/9.32 [2019-03-29 01:53:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 18.81/9.32 [2019-03-29 01:53:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. 18.81/9.32 [2019-03-29 01:53:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 2 letters. Loop has 3 letters. 18.81/9.32 [2019-03-29 01:53:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 5 letters. Loop has 3 letters. 18.81/9.32 [2019-03-29 01:53:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 2 letters. Loop has 6 letters. 18.81/9.32 [2019-03-29 01:53:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 420 transitions. 18.81/9.32 [2019-03-29 01:53:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.32 [2019-03-29 01:53:34,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 18.81/9.32 [2019-03-29 01:53:34,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 18.81/9.32 [2019-03-29 01:53:34,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.81/9.32 [2019-03-29 01:53:34,062 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 18.81/9.32 [2019-03-29 01:53:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 18.81/9.32 [2019-03-29 01:53:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,065 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,065 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,065 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 18.81/9.32 [2019-03-29 01:53:34,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 52 transitions. 18.81/9.32 [2019-03-29 01:53:34,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.32 [2019-03-29 01:53:34,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.32 [2019-03-29 01:53:34,067 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.32 [2019-03-29 01:53:34,067 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 18.81/9.32 [2019-03-29 01:53:34,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 18.81/9.32 [2019-03-29 01:53:34,067 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 331#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 320#L20 18.81/9.32 [2019-03-29 01:53:34,068 INFO L796 eck$LassoCheckResult]: Loop: 320#L20 [53] L20-->L21: Formula: (and (<= v_ULTIMATE.start_main_~i~0_8 v_ULTIMATE.start_main_~an~0_8) (<= v_ULTIMATE.start_main_~j~0_8 v_ULTIMATE.start_main_~bn~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[] 328#L21 [68] L21-->L28-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_9 (+ v_ULTIMATE.start_main_~j~0_10 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 319#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 320#L20 18.81/9.32 [2019-03-29 01:53:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2478, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:34,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash 82892, now seen corresponding path program 2 times 18.81/9.32 [2019-03-29 01:53:34,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 73875199, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:34,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,123 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:34,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:34,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:34,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:34,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.81/9.32 [2019-03-29 01:53:34,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:34,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:34,124 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:34,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 18.81/9.32 [2019-03-29 01:53:34,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:34,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:34,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,187 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:34,188 INFO L412 LassoAnalysis]: Checking for nontermination... 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:34,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:34,193 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:34,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.81/9.32 [2019-03-29 01:53:34,221 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:34,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:34,228 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:34,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:34,261 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:34,602 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.81/9.32 [2019-03-29 01:53:34,605 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:34,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:34,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:34,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:34,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.81/9.32 [2019-03-29 01:53:34,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:34,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:34,606 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:34,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 18.81/9.32 [2019-03-29 01:53:34,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:34,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:34,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:34,671 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:34,671 INFO L497 LassoAnalysis]: Using template 'affine'. 18.81/9.32 [2019-03-29 01:53:34,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.81/9.32 Termination analysis: LINEAR_WITH_GUESSES 18.81/9.32 Number of strict supporting invariants: 0 18.81/9.32 Number of non-strict supporting invariants: 1 18.81/9.32 Consider only non-deceasing supporting invariants: true 18.81/9.32 Simplify termination arguments: true 18.81/9.32 Simplify supporting invariants: trueOverapproximate stem: false 18.81/9.32 [2019-03-29 01:53:34,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.81/9.32 [2019-03-29 01:53:34,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.81/9.32 [2019-03-29 01:53:34,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.81/9.32 [2019-03-29 01:53:34,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.81/9.32 [2019-03-29 01:53:34,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.81/9.32 [2019-03-29 01:53:34,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.81/9.32 [2019-03-29 01:53:34,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.81/9.32 [2019-03-29 01:53:34,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.81/9.32 [2019-03-29 01:53:34,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.81/9.32 Termination analysis: LINEAR_WITH_GUESSES 18.81/9.32 Number of strict supporting invariants: 0 18.81/9.32 Number of non-strict supporting invariants: 1 18.81/9.32 Consider only non-deceasing supporting invariants: true 18.81/9.32 Simplify termination arguments: true 18.81/9.32 Simplify supporting invariants: trueOverapproximate stem: false 18.81/9.32 [2019-03-29 01:53:34,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.81/9.32 [2019-03-29 01:53:34,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.81/9.32 [2019-03-29 01:53:34,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.81/9.32 [2019-03-29 01:53:34,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.81/9.32 [2019-03-29 01:53:34,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.81/9.32 [2019-03-29 01:53:34,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.81/9.32 [2019-03-29 01:53:34,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.81/9.32 [2019-03-29 01:53:34,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.81/9.32 [2019-03-29 01:53:34,687 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.81/9.32 [2019-03-29 01:53:34,687 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 18.81/9.32 [2019-03-29 01:53:34,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.81/9.32 [2019-03-29 01:53:34,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.81/9.32 [2019-03-29 01:53:34,688 INFO L518 LassoAnalysis]: Proved termination. 18.81/9.32 [2019-03-29 01:53:34,688 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.81/9.32 Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~bn~0 + 1 18.81/9.32 Supporting invariants [] 18.81/9.32 [2019-03-29 01:53:34,688 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.81/9.32 [2019-03-29 01:53:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:34,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:34,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:34,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.81/9.32 [2019-03-29 01:53:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:34,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:34,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:34,808 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 18.81/9.32 [2019-03-29 01:53:34,808 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 18.81/9.32 [2019-03-29 01:53:34,808 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 52 transitions. cyclomatic complexity: 34 Second operand 4 states. 18.81/9.32 [2019-03-29 01:53:34,877 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 52 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 157 states and 371 transitions. Complement of second has 21 states. 18.81/9.32 [2019-03-29 01:53:34,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 18.81/9.32 [2019-03-29 01:53:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 18.81/9.32 [2019-03-29 01:53:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. 18.81/9.32 [2019-03-29 01:53:34,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 3 letters. 18.81/9.32 [2019-03-29 01:53:34,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. 18.81/9.32 [2019-03-29 01:53:34,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 6 letters. 18.81/9.32 [2019-03-29 01:53:34,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:34,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 371 transitions. 18.81/9.32 [2019-03-29 01:53:34,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.32 [2019-03-29 01:53:34,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 18.81/9.32 [2019-03-29 01:53:34,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 18.81/9.32 [2019-03-29 01:53:34,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.81/9.32 [2019-03-29 01:53:34,890 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 18.81/9.32 [2019-03-29 01:53:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 18.81/9.32 [2019-03-29 01:53:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,894 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,894 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,894 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 18.81/9.32 [2019-03-29 01:53:34,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 44 transitions. 18.81/9.32 [2019-03-29 01:53:34,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 18.81/9.32 [2019-03-29 01:53:34,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.32 [2019-03-29 01:53:34,895 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.32 [2019-03-29 01:53:34,895 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 18.81/9.32 [2019-03-29 01:53:34,895 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 18.81/9.32 [2019-03-29 01:53:34,896 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 570#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 575#L20 18.81/9.32 [2019-03-29 01:53:34,896 INFO L796 eck$LassoCheckResult]: Loop: 575#L20 [66] L20-->L26: Formula: (> v_ULTIMATE.start_main_~j~0_11 v_ULTIMATE.start_main_~bn~0_9) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} AuxVars[] AssignedVars[] 576#L26 [70] L26-->L28: Formula: (> v_ULTIMATE.start_main_~bn~0_11 v_ULTIMATE.start_main_~j~0_13) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} AuxVars[] AssignedVars[] 578#L28 [50] L28-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~j~0_15 v_ULTIMATE.start_main_~bn~0_12) (= v_ULTIMATE.start_main_~j~0_14 (+ v_ULTIMATE.start_main_~j~0_15 1)) (<= v_ULTIMATE.start_main_~an~0_12 v_ULTIMATE.start_main_~i~0_15)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 577#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 575#L20 18.81/9.32 [2019-03-29 01:53:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2479, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:34,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2958608, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:34,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.81/9.32 [2019-03-29 01:53:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.81/9.32 [2019-03-29 01:53:34,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.81/9.32 [2019-03-29 01:53:34,944 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.81/9.32 [2019-03-29 01:53:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.81/9.32 [2019-03-29 01:53:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.81/9.32 [2019-03-29 01:53:34,948 INFO L87 Difference]: Start difference. First operand 21 states and 44 transitions. cyclomatic complexity: 26 Second operand 3 states. 18.81/9.32 [2019-03-29 01:53:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.81/9.32 [2019-03-29 01:53:34,977 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. 18.81/9.32 [2019-03-29 01:53:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.81/9.32 [2019-03-29 01:53:34,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. 18.81/9.32 [2019-03-29 01:53:34,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 18.81/9.32 [2019-03-29 01:53:34,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 18.81/9.32 [2019-03-29 01:53:34,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 18.81/9.32 [2019-03-29 01:53:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.81/9.32 [2019-03-29 01:53:34,981 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 18.81/9.32 [2019-03-29 01:53:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 18.81/9.32 [2019-03-29 01:53:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,983 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,984 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,984 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 18.81/9.32 [2019-03-29 01:53:34,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. 18.81/9.32 [2019-03-29 01:53:34,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 18.81/9.32 [2019-03-29 01:53:34,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.81/9.32 [2019-03-29 01:53:34,985 INFO L119 BuchiIsEmpty]: Starting construction of run 18.81/9.32 [2019-03-29 01:53:34,985 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 18.81/9.32 [2019-03-29 01:53:34,985 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 18.81/9.32 [2019-03-29 01:53:34,985 INFO L794 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 625#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 628#L20 18.81/9.32 [2019-03-29 01:53:34,986 INFO L796 eck$LassoCheckResult]: Loop: 628#L20 [67] L20-->L26: Formula: (> v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_9) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 617#L26 [70] L26-->L28: Formula: (> v_ULTIMATE.start_main_~bn~0_11 v_ULTIMATE.start_main_~j~0_13) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} AuxVars[] AssignedVars[] 618#L28 [50] L28-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~j~0_15 v_ULTIMATE.start_main_~bn~0_12) (= v_ULTIMATE.start_main_~j~0_14 (+ v_ULTIMATE.start_main_~j~0_15 1)) (<= v_ULTIMATE.start_main_~an~0_12 v_ULTIMATE.start_main_~i~0_15)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 626#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 628#L20 18.81/9.32 [2019-03-29 01:53:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2479, now seen corresponding path program 2 times 18.81/9.32 [2019-03-29 01:53:34,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2988399, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:34,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:34,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:34,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2003493859, now seen corresponding path program 1 times 18.81/9.32 [2019-03-29 01:53:35,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.81/9.32 [2019-03-29 01:53:35,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.81/9.32 [2019-03-29 01:53:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.81/9.32 [2019-03-29 01:53:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.81/9.32 [2019-03-29 01:53:35,032 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:35,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:35,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:35,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:35,033 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.81/9.32 [2019-03-29 01:53:35,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:35,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:35,033 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:35,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 18.81/9.32 [2019-03-29 01:53:35,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:35,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:35,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,085 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:35,086 INFO L412 LassoAnalysis]: Checking for nontermination... 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:35,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:35,093 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:35,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.81/9.32 [2019-03-29 01:53:35,121 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:35,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:35,128 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.81/9.32 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.81/9.32 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:35,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.81/9.32 [2019-03-29 01:53:35,159 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.81/9.32 [2019-03-29 01:53:35,694 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.81/9.32 [2019-03-29 01:53:35,697 INFO L216 LassoAnalysis]: Preferences: 18.81/9.32 [2019-03-29 01:53:35,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.81/9.32 [2019-03-29 01:53:35,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.81/9.32 [2019-03-29 01:53:35,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.81/9.32 [2019-03-29 01:53:35,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.81/9.32 [2019-03-29 01:53:35,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.81/9.32 [2019-03-29 01:53:35,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.81/9.32 [2019-03-29 01:53:35,698 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.81/9.32 [2019-03-29 01:53:35,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 18.81/9.32 [2019-03-29 01:53:35,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.81/9.32 [2019-03-29 01:53:35,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.81/9.32 [2019-03-29 01:53:35,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.81/9.32 [2019-03-29 01:53:35,741 INFO L300 LassoAnalysis]: Preprocessing complete. 18.81/9.32 [2019-03-29 01:53:35,742 INFO L497 LassoAnalysis]: Using template 'affine'. 18.81/9.32 [2019-03-29 01:53:35,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.81/9.32 Termination analysis: LINEAR_WITH_GUESSES 18.81/9.32 Number of strict supporting invariants: 0 18.81/9.32 Number of non-strict supporting invariants: 1 18.81/9.32 Consider only non-deceasing supporting invariants: true 18.81/9.32 Simplify termination arguments: true 18.81/9.32 Simplify supporting invariants: trueOverapproximate stem: false 18.81/9.32 [2019-03-29 01:53:35,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.81/9.32 [2019-03-29 01:53:35,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.81/9.32 [2019-03-29 01:53:35,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.81/9.32 [2019-03-29 01:53:35,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.81/9.32 [2019-03-29 01:53:35,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.81/9.32 [2019-03-29 01:53:35,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.81/9.32 [2019-03-29 01:53:35,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.81/9.32 [2019-03-29 01:53:35,748 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.81/9.32 [2019-03-29 01:53:35,752 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 18.81/9.32 [2019-03-29 01:53:35,752 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 18.81/9.32 [2019-03-29 01:53:35,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.81/9.32 [2019-03-29 01:53:35,753 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.81/9.32 [2019-03-29 01:53:35,753 INFO L518 LassoAnalysis]: Proved termination. 18.81/9.32 [2019-03-29 01:53:35,753 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.81/9.32 Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~bn~0 18.81/9.32 Supporting invariants [] 18.81/9.32 [2019-03-29 01:53:35,754 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.81/9.32 [2019-03-29 01:53:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.81/9.32 [2019-03-29 01:53:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:35,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:35,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:35,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:35,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.81/9.32 [2019-03-29 01:53:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:35,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:35,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.81/9.32 [2019-03-29 01:53:35,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 18.81/9.32 [2019-03-29 01:53:35,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.81/9.32 [2019-03-29 01:53:35,847 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 18.81/9.32 [2019-03-29 01:53:35,848 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 18.81/9.32 [2019-03-29 01:53:35,848 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15 Second operand 4 states. 18.81/9.32 [2019-03-29 01:53:35,896 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 41 states and 71 transitions. Complement of second has 8 states. 18.81/9.32 [2019-03-29 01:53:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 18.81/9.32 [2019-03-29 01:53:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 18.81/9.32 [2019-03-29 01:53:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 18.81/9.32 [2019-03-29 01:53:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. 18.81/9.32 [2019-03-29 01:53:35,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. 18.81/9.32 [2019-03-29 01:53:35,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:35,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. 18.81/9.32 [2019-03-29 01:53:35,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.81/9.32 [2019-03-29 01:53:35,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 71 transitions. 18.81/9.32 [2019-03-29 01:53:35,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.81/9.32 [2019-03-29 01:53:35,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 18.81/9.32 [2019-03-29 01:53:35,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 18.81/9.32 [2019-03-29 01:53:35,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,902 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 18.81/9.32 [2019-03-29 01:53:35,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 18.81/9.32 [2019-03-29 01:53:35,903 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.81/9.32 [2019-03-29 01:53:35,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 18.81/9.32 [2019-03-29 01:53:35,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:53:35 BasicIcfg 18.81/9.32 [2019-03-29 01:53:35,909 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 18.81/9.32 [2019-03-29 01:53:35,910 INFO L168 Benchmark]: Toolchain (without parser) took 4740.74 ms. Allocated memory was 649.6 MB in the beginning and 753.9 MB in the end (delta: 104.3 MB). Free memory was 563.8 MB in the beginning and 603.9 MB in the end (delta: -40.0 MB). Peak memory consumption was 64.3 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,911 INFO L168 Benchmark]: CDTParser took 0.17 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. 18.81/9.32 [2019-03-29 01:53:35,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.90 ms. Allocated memory is still 649.6 MB. Free memory was 563.8 MB in the beginning and 554.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.31 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 554.1 MB in the beginning and 649.2 MB in the end (delta: -95.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,913 INFO L168 Benchmark]: Boogie Preprocessor took 20.25 ms. Allocated memory is still 684.7 MB. Free memory was 649.2 MB in the beginning and 647.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,914 INFO L168 Benchmark]: RCFGBuilder took 217.07 ms. Allocated memory is still 684.7 MB. Free memory was 647.9 MB in the beginning and 633.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,914 INFO L168 Benchmark]: BlockEncodingV2 took 85.04 ms. Allocated memory is still 684.7 MB. Free memory was 633.4 MB in the beginning and 626.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,915 INFO L168 Benchmark]: TraceAbstraction took 155.09 ms. Allocated memory is still 684.7 MB. Free memory was 626.9 MB in the beginning and 617.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,915 INFO L168 Benchmark]: BuchiAutomizer took 3915.75 ms. Allocated memory was 684.7 MB in the beginning and 753.9 MB in the end (delta: 69.2 MB). Free memory was 617.5 MB in the beginning and 603.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 82.8 MB. Max. memory is 50.3 GB. 18.81/9.32 [2019-03-29 01:53:35,919 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 18.81/9.32 --- Results --- 18.81/9.32 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 18.81/9.32 - StatisticsResult: Initial Icfg 18.81/9.32 10 locations, 15 edges 18.81/9.32 - StatisticsResult: Encoded RCFG 18.81/9.32 6 locations, 16 edges 18.81/9.32 * Results from de.uni_freiburg.informatik.ultimate.core: 18.81/9.32 - StatisticsResult: Toolchain Benchmarks 18.81/9.32 Benchmark results are: 18.81/9.32 * CDTParser took 0.17 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. 18.81/9.32 * CACSL2BoogieTranslator took 243.90 ms. Allocated memory is still 649.6 MB. Free memory was 563.8 MB in the beginning and 554.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.81/9.32 * Boogie Procedure Inliner took 97.31 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 554.1 MB in the beginning and 649.2 MB in the end (delta: -95.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 50.3 GB. 18.81/9.32 * Boogie Preprocessor took 20.25 ms. Allocated memory is still 684.7 MB. Free memory was 649.2 MB in the beginning and 647.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.81/9.32 * RCFGBuilder took 217.07 ms. Allocated memory is still 684.7 MB. Free memory was 647.9 MB in the beginning and 633.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 18.81/9.32 * BlockEncodingV2 took 85.04 ms. Allocated memory is still 684.7 MB. Free memory was 633.4 MB in the beginning and 626.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 18.81/9.32 * TraceAbstraction took 155.09 ms. Allocated memory is still 684.7 MB. Free memory was 626.9 MB in the beginning and 617.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 18.81/9.32 * BuchiAutomizer took 3915.75 ms. Allocated memory was 684.7 MB in the beginning and 753.9 MB in the end (delta: 69.2 MB). Free memory was 617.5 MB in the beginning and 603.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 82.8 MB. Max. memory is 50.3 GB. 18.81/9.32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 18.81/9.32 - AllSpecificationsHoldResult: All specifications hold 18.81/9.32 We were not able to verify any specifiation because the program does not contain any specification. 18.81/9.32 - InvariantResult [Line: 19]: Loop Invariant 18.81/9.32 Derived loop invariant: 1 18.81/9.32 - StatisticsResult: Ultimate Automizer benchmark data 18.81/9.32 CFG has 1 procedures, 6 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=6occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 18.81/9.32 - StatisticsResult: Constructed decomposition of program 18.81/9.32 Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function 2 * an + -2 * i + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * bn + -2 * j + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * j + 2 * bn + 1 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + bn and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 18.81/9.32 - StatisticsResult: Timing statistics 18.81/9.32 BüchiAutomizer plugin needed 3.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 148 SDslu, 28 SDs, 0 SdLazy, 211 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax177 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s 18.81/9.32 - TerminationAnalysisResult: Termination proven 18.81/9.32 Buchi Automizer proved that your program is terminating 18.81/9.32 RESULT: Ultimate proved your program to be correct! 18.81/9.32 !SESSION 2019-03-29 01:53:27.855 ----------------------------------------------- 18.81/9.32 eclipse.buildId=unknown 18.81/9.32 java.version=1.8.0_181 18.81/9.32 java.vendor=Oracle Corporation 18.81/9.32 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 18.81/9.32 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.81/9.32 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.81/9.32 18.81/9.32 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:53:36.152 18.81/9.32 !MESSAGE The workspace will exit with unsaved changes in this session. 18.81/9.32 Received shutdown request... 18.81/9.32 Ultimate: 18.81/9.32 GTK+ Version Check 18.81/9.32 EOF