17.97/8.31 YES 17.97/8.31 17.97/8.31 Ultimate: Cannot open display: 17.97/8.31 This is Ultimate 0.1.24-8dc7c08-m 17.97/8.31 [2019-03-29 01:47:14,051 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.97/8.31 [2019-03-29 01:47:14,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.97/8.31 [2019-03-29 01:47:14,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.97/8.31 [2019-03-29 01:47:14,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.97/8.31 [2019-03-29 01:47:14,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.97/8.31 [2019-03-29 01:47:14,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.97/8.31 [2019-03-29 01:47:14,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.97/8.31 [2019-03-29 01:47:14,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.97/8.31 [2019-03-29 01:47:14,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.97/8.31 [2019-03-29 01:47:14,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.97/8.31 [2019-03-29 01:47:14,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.97/8.31 [2019-03-29 01:47:14,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.97/8.31 [2019-03-29 01:47:14,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.97/8.31 [2019-03-29 01:47:14,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.97/8.31 [2019-03-29 01:47:14,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.97/8.31 [2019-03-29 01:47:14,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.97/8.31 [2019-03-29 01:47:14,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.97/8.31 [2019-03-29 01:47:14,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.97/8.31 [2019-03-29 01:47:14,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.97/8.31 [2019-03-29 01:47:14,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.97/8.31 [2019-03-29 01:47:14,087 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.97/8.31 [2019-03-29 01:47:14,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.97/8.31 [2019-03-29 01:47:14,088 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.97/8.31 [2019-03-29 01:47:14,089 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.97/8.31 [2019-03-29 01:47:14,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.97/8.31 [2019-03-29 01:47:14,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.97/8.31 [2019-03-29 01:47:14,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.97/8.31 [2019-03-29 01:47:14,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.97/8.31 [2019-03-29 01:47:14,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.97/8.31 [2019-03-29 01:47:14,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.97/8.31 [2019-03-29 01:47:14,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.97/8.31 [2019-03-29 01:47:14,095 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 17.97/8.31 [2019-03-29 01:47:14,110 INFO L110 SettingsManager]: Loading preferences was successful 17.97/8.31 [2019-03-29 01:47:14,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.97/8.31 [2019-03-29 01:47:14,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.97/8.31 [2019-03-29 01:47:14,111 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.97/8.31 [2019-03-29 01:47:14,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.97/8.31 [2019-03-29 01:47:14,111 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.97/8.31 [2019-03-29 01:47:14,112 INFO L133 SettingsManager]: * Use SBE=true 17.97/8.31 [2019-03-29 01:47:14,112 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.97/8.31 [2019-03-29 01:47:14,112 INFO L133 SettingsManager]: * Use old map elimination=false 17.97/8.31 [2019-03-29 01:47:14,112 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.97/8.31 [2019-03-29 01:47:14,112 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.97/8.31 [2019-03-29 01:47:14,112 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.97/8.31 [2019-03-29 01:47:14,113 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.97/8.31 [2019-03-29 01:47:14,113 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.97/8.31 [2019-03-29 01:47:14,113 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:14,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.97/8.31 [2019-03-29 01:47:14,113 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.97/8.31 [2019-03-29 01:47:14,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.97/8.31 [2019-03-29 01:47:14,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.97/8.31 [2019-03-29 01:47:14,114 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.97/8.31 [2019-03-29 01:47:14,114 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.97/8.31 [2019-03-29 01:47:14,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.97/8.31 [2019-03-29 01:47:14,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.97/8.31 [2019-03-29 01:47:14,115 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.97/8.31 [2019-03-29 01:47:14,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.97/8.31 [2019-03-29 01:47:14,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.97/8.31 [2019-03-29 01:47:14,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.97/8.31 [2019-03-29 01:47:14,115 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.97/8.31 [2019-03-29 01:47:14,115 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.97/8.31 [2019-03-29 01:47:14,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.97/8.31 [2019-03-29 01:47:14,154 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.97/8.31 [2019-03-29 01:47:14,157 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.97/8.31 [2019-03-29 01:47:14,159 INFO L271 PluginConnector]: Initializing CDTParser... 17.97/8.31 [2019-03-29 01:47:14,159 INFO L276 PluginConnector]: CDTParser initialized 17.97/8.31 [2019-03-29 01:47:14,160 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 17.97/8.31 [2019-03-29 01:47:14,224 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/59eab2f659554da7818189869bf4381a/FLAGc67d26f5e 17.97/8.31 [2019-03-29 01:47:14,574 INFO L307 CDTParser]: Found 1 translation units. 17.97/8.31 [2019-03-29 01:47:14,575 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 17.97/8.31 [2019-03-29 01:47:14,582 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/59eab2f659554da7818189869bf4381a/FLAGc67d26f5e 17.97/8.31 [2019-03-29 01:47:14,968 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/59eab2f659554da7818189869bf4381a 17.97/8.31 [2019-03-29 01:47:14,980 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.97/8.31 [2019-03-29 01:47:14,981 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.97/8.31 [2019-03-29 01:47:14,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.97/8.31 [2019-03-29 01:47:14,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.97/8.31 [2019-03-29 01:47:14,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.97/8.31 [2019-03-29 01:47:14,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:47:14" (1/1) ... 17.97/8.31 [2019-03-29 01:47:14,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf66568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:14, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:14,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:47:14" (1/1) ... 17.97/8.31 [2019-03-29 01:47:14,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.97/8.31 [2019-03-29 01:47:15,017 INFO L176 MainTranslator]: Built tables and reachable declarations 17.97/8.31 [2019-03-29 01:47:15,177 INFO L206 PostProcessor]: Analyzing one entry point: main 17.97/8.31 [2019-03-29 01:47:15,181 INFO L191 MainTranslator]: Completed pre-run 17.97/8.31 [2019-03-29 01:47:15,199 INFO L206 PostProcessor]: Analyzing one entry point: main 17.97/8.31 [2019-03-29 01:47:15,213 INFO L195 MainTranslator]: Completed translation 17.97/8.31 [2019-03-29 01:47:15,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15 WrapperNode 17.97/8.31 [2019-03-29 01:47:15,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.97/8.31 [2019-03-29 01:47:15,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.97/8.31 [2019-03-29 01:47:15,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.97/8.31 [2019-03-29 01:47:15,215 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.97/8.31 [2019-03-29 01:47:15,280 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:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,286 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:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.97/8.31 [2019-03-29 01:47:15,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.97/8.31 [2019-03-29 01:47:15,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.97/8.31 [2019-03-29 01:47:15,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.97/8.31 [2019-03-29 01:47:15,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.97/8.31 [2019-03-29 01:47:15,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.97/8.31 [2019-03-29 01:47:15,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.97/8.31 [2019-03-29 01:47:15,326 INFO L276 PluginConnector]: RCFGBuilder initialized 17.97/8.31 [2019-03-29 01:47:15,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (1/1) ... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.97/8.31 [2019-03-29 01:47:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.97/8.31 [2019-03-29 01:47:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.97/8.31 [2019-03-29 01:47:15,529 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.97/8.31 [2019-03-29 01:47:15,529 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.97/8.31 [2019-03-29 01:47:15,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:47:15 BoogieIcfgContainer 17.97/8.31 [2019-03-29 01:47:15,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.97/8.31 [2019-03-29 01:47:15,531 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.97/8.31 [2019-03-29 01:47:15,531 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.97/8.31 [2019-03-29 01:47:15,533 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.97/8.31 [2019-03-29 01:47:15,534 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:47:15" (1/1) ... 17.97/8.31 [2019-03-29 01:47:15,549 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 17.97/8.31 [2019-03-29 01:47:15,550 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.97/8.31 [2019-03-29 01:47:15,551 INFO L263 BlockEncoder]: Using Maximize final states 17.97/8.31 [2019-03-29 01:47:15,551 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.97/8.31 [2019-03-29 01:47:15,552 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.97/8.31 [2019-03-29 01:47:15,553 INFO L296 BlockEncoder]: Using Remove sink states 17.97/8.31 [2019-03-29 01:47:15,554 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.97/8.31 [2019-03-29 01:47:15,555 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.97/8.31 [2019-03-29 01:47:15,570 INFO L185 BlockEncoder]: Using Use SBE 17.97/8.31 [2019-03-29 01:47:15,587 INFO L200 BlockEncoder]: SBE split 3 edges 17.97/8.31 [2019-03-29 01:47:15,592 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.97/8.31 [2019-03-29 01:47:15,594 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.97/8.31 [2019-03-29 01:47:15,604 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 17.97/8.31 [2019-03-29 01:47:15,606 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 17.97/8.31 [2019-03-29 01:47:15,607 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.97/8.31 [2019-03-29 01:47:15,608 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.97/8.31 [2019-03-29 01:47:15,608 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.97/8.31 [2019-03-29 01:47:15,608 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.97/8.31 [2019-03-29 01:47:15,609 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 8 edges 17.97/8.31 [2019-03-29 01:47:15,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:47:15 BasicIcfg 17.97/8.31 [2019-03-29 01:47:15,609 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.97/8.31 [2019-03-29 01:47:15,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.97/8.31 [2019-03-29 01:47:15,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.97/8.31 [2019-03-29 01:47:15,614 INFO L276 PluginConnector]: TraceAbstraction initialized 17.97/8.31 [2019-03-29 01:47:15,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:47:14" (1/4) ... 17.97/8.31 [2019-03-29 01:47:15,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba0c3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (2/4) ... 17.97/8.31 [2019-03-29 01:47:15,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba0c3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:47:15" (3/4) ... 17.97/8.31 [2019-03-29 01:47:15,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba0c3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:47:15" (4/4) ... 17.97/8.31 [2019-03-29 01:47:15,618 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.97/8.31 [2019-03-29 01:47:15,629 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.97/8.31 [2019-03-29 01:47:15,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.97/8.31 [2019-03-29 01:47:15,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.97/8.31 [2019-03-29 01:47:15,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.97/8.31 [2019-03-29 01:47:15,685 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.97/8.31 [2019-03-29 01:47:15,685 INFO L383 AbstractCegarLoop]: Hoare is true 17.97/8.31 [2019-03-29 01:47:15,685 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.97/8.31 [2019-03-29 01:47:15,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.97/8.31 [2019-03-29 01:47:15,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.97/8.31 [2019-03-29 01:47:15,686 INFO L387 AbstractCegarLoop]: Difference is false 17.97/8.31 [2019-03-29 01:47:15,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.97/8.31 [2019-03-29 01:47:15,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.97/8.31 [2019-03-29 01:47:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 17.97/8.31 [2019-03-29 01:47:15,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.97/8.31 [2019-03-29 01:47:15,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 17.97/8.31 [2019-03-29 01:47:15,763 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.97/8.31 [2019-03-29 01:47:15,764 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 29) no Hoare annotation was computed. 17.97/8.31 [2019-03-29 01:47:15,764 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 20 30) the Hoare annotation is: true 17.97/8.31 [2019-03-29 01:47:15,765 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. 17.97/8.31 [2019-03-29 01:47:15,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:47:15 BasicIcfg 17.97/8.31 [2019-03-29 01:47:15,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.97/8.31 [2019-03-29 01:47:15,774 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.97/8.31 [2019-03-29 01:47:15,774 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.97/8.31 [2019-03-29 01:47:15,777 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.97/8.31 [2019-03-29 01:47:15,778 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.97/8.31 [2019-03-29 01:47:15,778 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:47:14" (1/5) ... 17.97/8.31 [2019-03-29 01:47:15,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3502fb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,779 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.97/8.31 [2019-03-29 01:47:15,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:47:15" (2/5) ... 17.97/8.31 [2019-03-29 01:47:15,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3502fb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.97/8.31 [2019-03-29 01:47:15,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:47:15" (3/5) ... 17.97/8.31 [2019-03-29 01:47:15,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3502fb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,781 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.97/8.31 [2019-03-29 01:47:15,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:47:15" (4/5) ... 17.97/8.31 [2019-03-29 01:47:15,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3502fb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:47:15, skipping insertion in model container 17.97/8.31 [2019-03-29 01:47:15,781 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.97/8.31 [2019-03-29 01:47:15,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:47:15" (5/5) ... 17.97/8.31 [2019-03-29 01:47:15,783 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.97/8.31 [2019-03-29 01:47:15,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.97/8.31 [2019-03-29 01:47:15,811 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.97/8.31 [2019-03-29 01:47:15,811 INFO L375 BuchiCegarLoop]: Hoare is true 17.97/8.31 [2019-03-29 01:47:15,811 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.97/8.31 [2019-03-29 01:47:15,811 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.97/8.31 [2019-03-29 01:47:15,811 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.97/8.31 [2019-03-29 01:47:15,812 INFO L379 BuchiCegarLoop]: Difference is false 17.97/8.31 [2019-03-29 01:47:15,812 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.97/8.31 [2019-03-29 01:47:15,812 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.97/8.31 [2019-03-29 01:47:15,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 17.97/8.31 [2019-03-29 01:47:15,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.97/8.31 [2019-03-29 01:47:15,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:15,833 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:15,840 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.97/8.31 [2019-03-29 01:47:15,840 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.97/8.31 [2019-03-29 01:47:15,840 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.97/8.31 [2019-03-29 01:47:15,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 17.97/8.31 [2019-03-29 01:47:15,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.97/8.31 [2019-03-29 01:47:15,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:15,841 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:15,842 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.97/8.31 [2019-03-29 01:47:15,842 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.97/8.31 [2019-03-29 01:47:15,847 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~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_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_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_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L23-2true 17.97/8.31 [2019-03-29 01:47:15,847 INFO L796 eck$LassoCheckResult]: Loop: 3#L23-2true [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 4#L21true [46] L21-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 3#L23-2true 17.97/8.31 [2019-03-29 01:47:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:15,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:15,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1999, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:15,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 64464, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:15,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,015 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:16,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:16,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:16,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:16,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.97/8.31 [2019-03-29 01:47:16,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:16,018 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:16,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.97/8.31 [2019-03-29 01:47:16,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:16,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:16,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,154 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:16,155 INFO L412 LassoAnalysis]: Checking for nontermination... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,162 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:16,196 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: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,207 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:16,235 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: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,242 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,280 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,310 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.97/8.31 [2019-03-29 01:47:16,312 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:16,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:16,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:16,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:16,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.97/8.31 [2019-03-29 01:47:16,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:16,313 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:16,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.97/8.31 [2019-03-29 01:47:16,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:16,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:16,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,393 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:16,399 INFO L497 LassoAnalysis]: Using template 'affine'. 17.97/8.31 [2019-03-29 01:47:16,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:16,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:16,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:16,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:16,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:16,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:16,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:16,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:16,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:16,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:16,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:16,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:16,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:16,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:16,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:16,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:16,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:16,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:16,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:16,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:16,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:16,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:16,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:16,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:16,438 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.97/8.31 [2019-03-29 01:47:16,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.97/8.31 [2019-03-29 01:47:16,442 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.97/8.31 [2019-03-29 01:47:16,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.97/8.31 [2019-03-29 01:47:16,444 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.97/8.31 [2019-03-29 01:47:16,444 INFO L518 LassoAnalysis]: Proved termination. 17.97/8.31 [2019-03-29 01:47:16,444 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.97/8.31 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 17.97/8.31 Supporting invariants [] 17.97/8.31 [2019-03-29 01:47:16,446 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.97/8.31 [2019-03-29 01:47:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:16,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:16,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:16,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:16,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.97/8.31 [2019-03-29 01:47:16,540 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.97/8.31 [2019-03-29 01:47:16,545 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 17.97/8.31 [2019-03-29 01:47:16,546 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 17.97/8.31 [2019-03-29 01:47:16,590 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 13 states and 24 transitions. Complement of second has 4 states. 17.97/8.31 [2019-03-29 01:47:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 17.97/8.31 [2019-03-29 01:47:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.97/8.31 [2019-03-29 01:47:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 17.97/8.31 [2019-03-29 01:47:16,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 4 letters. 17.97/8.31 [2019-03-29 01:47:16,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:16,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 24 transitions. 17.97/8.31 [2019-03-29 01:47:16,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 17.97/8.31 [2019-03-29 01:47:16,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 24 transitions. 17.97/8.31 [2019-03-29 01:47:16,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 17.97/8.31 [2019-03-29 01:47:16,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 17.97/8.31 [2019-03-29 01:47:16,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 24 transitions. 17.97/8.31 [2019-03-29 01:47:16,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.97/8.31 [2019-03-29 01:47:16,611 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 17.97/8.31 [2019-03-29 01:47:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 24 transitions. 17.97/8.31 [2019-03-29 01:47:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. 17.97/8.31 [2019-03-29 01:47:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 17.97/8.31 [2019-03-29 01:47:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. 17.97/8.31 [2019-03-29 01:47:16,641 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 23 transitions. 17.97/8.31 [2019-03-29 01:47:16,642 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 23 transitions. 17.97/8.31 [2019-03-29 01:47:16,642 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.97/8.31 [2019-03-29 01:47:16,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 23 transitions. 17.97/8.31 [2019-03-29 01:47:16,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 17.97/8.31 [2019-03-29 01:47:16,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:16,643 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:16,643 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.97/8.31 [2019-03-29 01:47:16,643 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.97/8.31 [2019-03-29 01:47:16,644 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~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_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_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_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 58#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 51#L21 17.97/8.31 [2019-03-29 01:47:16,644 INFO L796 eck$LassoCheckResult]: Loop: 51#L21 [34] L21-->L23: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 54#L23 [48] L23-->L23-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 (- 1))) (= v_ULTIMATE.start_main_~z~0_6 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 50#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 51#L21 17.97/8.31 [2019-03-29 01:47:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2078, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:16,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:16,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 63985, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:16,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:16,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:16,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash 61939892, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:16,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:16,712 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:16,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:16,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:16,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:16,713 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.97/8.31 [2019-03-29 01:47:16,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:16,713 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:16,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.97/8.31 [2019-03-29 01:47:16,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:16,713 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:16,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:16,804 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:16,804 INFO L412 LassoAnalysis]: Checking for nontermination... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,809 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:16,837 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: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,843 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:16,847 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,877 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:16,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:16,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,913 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:16,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:16,946 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,022 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.97/8.31 [2019-03-29 01:47:17,025 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:17,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:17,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:17,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:17,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.97/8.31 [2019-03-29 01:47:17,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:17,026 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:17,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.97/8.31 [2019-03-29 01:47:17,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:17,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:17,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,154 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:17,155 INFO L497 LassoAnalysis]: Using template 'affine'. 17.97/8.31 [2019-03-29 01:47:17,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,184 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.97/8.31 [2019-03-29 01:47:17,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.97/8.31 [2019-03-29 01:47:17,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.97/8.31 [2019-03-29 01:47:17,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.97/8.31 [2019-03-29 01:47:17,189 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.97/8.31 [2019-03-29 01:47:17,189 INFO L518 LassoAnalysis]: Proved termination. 17.97/8.31 [2019-03-29 01:47:17,189 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.97/8.31 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 17.97/8.31 Supporting invariants [] 17.97/8.31 [2019-03-29 01:47:17,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.97/8.31 [2019-03-29 01:47:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:17,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:17,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:17,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:17,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.97/8.31 [2019-03-29 01:47:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:17,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:17,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:17,294 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.97/8.31 [2019-03-29 01:47:17,295 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 17.97/8.31 [2019-03-29 01:47:17,295 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 23 transitions. cyclomatic complexity: 14 Second operand 4 states. 17.97/8.31 [2019-03-29 01:47:17,361 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 23 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 30 states and 58 transitions. Complement of second has 8 states. 17.97/8.31 [2019-03-29 01:47:17,361 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 17.97/8.31 [2019-03-29 01:47:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.97/8.31 [2019-03-29 01:47:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. 17.97/8.31 [2019-03-29 01:47:17,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 3 letters. 17.97/8.31 [2019-03-29 01:47:17,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:17,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. 17.97/8.31 [2019-03-29 01:47:17,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:17,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 6 letters. 17.97/8.31 [2019-03-29 01:47:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:17,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 58 transitions. 17.97/8.31 [2019-03-29 01:47:17,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.97/8.31 [2019-03-29 01:47:17,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 55 transitions. 17.97/8.31 [2019-03-29 01:47:17,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 17.97/8.31 [2019-03-29 01:47:17,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 17.97/8.31 [2019-03-29 01:47:17,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 55 transitions. 17.97/8.31 [2019-03-29 01:47:17,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.97/8.31 [2019-03-29 01:47:17,371 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 55 transitions. 17.97/8.31 [2019-03-29 01:47:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 55 transitions. 17.97/8.31 [2019-03-29 01:47:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. 17.97/8.31 [2019-03-29 01:47:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 17.97/8.31 [2019-03-29 01:47:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. 17.97/8.31 [2019-03-29 01:47:17,375 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 45 transitions. 17.97/8.31 [2019-03-29 01:47:17,375 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 45 transitions. 17.97/8.31 [2019-03-29 01:47:17,375 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.97/8.31 [2019-03-29 01:47:17,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 45 transitions. 17.97/8.31 [2019-03-29 01:47:17,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.97/8.31 [2019-03-29 01:47:17,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:17,377 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:17,377 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 17.97/8.31 [2019-03-29 01:47:17,377 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.97/8.31 [2019-03-29 01:47:17,377 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~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_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_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_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 147#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 148#L21 [34] L21-->L23: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 144#L23 17.97/8.31 [2019-03-29 01:47:17,378 INFO L796 eck$LassoCheckResult]: Loop: 144#L23 [37] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_6 |v_ULTIMATE.start_main_#t~nondet6_3|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 151#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 154#L21 [34] L21-->L23: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 144#L23 17.97/8.31 [2019-03-29 01:47:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 64452, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:17,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:17,388 INFO L82 PathProgramCache]: Analyzing trace with hash 66374, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:17,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:17,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1920126115, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:17,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:17,443 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:17,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:17,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:17,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:17,444 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.97/8.31 [2019-03-29 01:47:17,444 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:17,444 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:17,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.97/8.31 [2019-03-29 01:47:17,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:17,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,553 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:17,553 INFO L412 LassoAnalysis]: Checking for nontermination... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,564 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:17,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,598 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:17,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,629 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,656 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:17,656 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,661 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,688 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:17,688 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,693 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:17,723 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:17,802 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.97/8.31 [2019-03-29 01:47:17,804 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:17,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:17,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:17,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:17,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.97/8.31 [2019-03-29 01:47:17,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:17,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:17,805 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:17,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.97/8.31 [2019-03-29 01:47:17,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:17,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:17,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:17,923 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:17,924 INFO L497 LassoAnalysis]: Using template 'affine'. 17.97/8.31 [2019-03-29 01:47:17,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:17,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:17,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:17,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:17,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:17,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:17,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:17,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:17,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:17,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.97/8.31 [2019-03-29 01:47:17,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.97/8.31 [2019-03-29 01:47:17,942 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.97/8.31 [2019-03-29 01:47:17,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.97/8.31 [2019-03-29 01:47:17,942 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.97/8.31 [2019-03-29 01:47:17,943 INFO L518 LassoAnalysis]: Proved termination. 17.97/8.31 [2019-03-29 01:47:17,943 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.97/8.31 Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 17.97/8.31 Supporting invariants [] 17.97/8.31 [2019-03-29 01:47:17,943 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.97/8.31 [2019-03-29 01:47:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:17,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:17,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:17,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:17,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.97/8.31 [2019-03-29 01:47:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:18,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:18,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:18,009 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 17.97/8.31 [2019-03-29 01:47:18,009 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 17.97/8.31 [2019-03-29 01:47:18,009 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 45 transitions. cyclomatic complexity: 28 Second operand 4 states. 17.97/8.31 [2019-03-29 01:47:18,084 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 45 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 51 states and 103 transitions. Complement of second has 14 states. 17.97/8.31 [2019-03-29 01:47:18,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 17.97/8.31 [2019-03-29 01:47:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.97/8.31 [2019-03-29 01:47:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. 17.97/8.31 [2019-03-29 01:47:18,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 3 letters. Loop has 3 letters. 17.97/8.31 [2019-03-29 01:47:18,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 3 letters. 17.97/8.31 [2019-03-29 01:47:18,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 3 letters. Loop has 6 letters. 17.97/8.31 [2019-03-29 01:47:18,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 103 transitions. 17.97/8.31 [2019-03-29 01:47:18,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 17.97/8.31 [2019-03-29 01:47:18,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 45 states and 95 transitions. 17.97/8.31 [2019-03-29 01:47:18,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 17.97/8.31 [2019-03-29 01:47:18,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 17.97/8.31 [2019-03-29 01:47:18,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 95 transitions. 17.97/8.31 [2019-03-29 01:47:18,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.97/8.31 [2019-03-29 01:47:18,094 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 95 transitions. 17.97/8.31 [2019-03-29 01:47:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 95 transitions. 17.97/8.31 [2019-03-29 01:47:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. 17.97/8.31 [2019-03-29 01:47:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 17.97/8.31 [2019-03-29 01:47:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. 17.97/8.31 [2019-03-29 01:47:18,099 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 81 transitions. 17.97/8.31 [2019-03-29 01:47:18,099 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 81 transitions. 17.97/8.31 [2019-03-29 01:47:18,099 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.97/8.31 [2019-03-29 01:47:18,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 81 transitions. 17.97/8.31 [2019-03-29 01:47:18,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 17.97/8.31 [2019-03-29 01:47:18,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:18,101 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:18,101 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 17.97/8.31 [2019-03-29 01:47:18,101 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.97/8.31 [2019-03-29 01:47:18,102 INFO L794 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~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_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_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_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 287#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 305#L21 [34] L21-->L23: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 288#L23 [37] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_6 |v_ULTIMATE.start_main_#t~nondet6_3|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 289#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 293#L21 [47] L21-->L23-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 282#L23-2 17.97/8.31 [2019-03-29 01:47:18,102 INFO L796 eck$LassoCheckResult]: Loop: 282#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 283#L21 [46] L21-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 282#L23-2 17.97/8.31 [2019-03-29 01:47:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1920126128, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:18,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1999, now seen corresponding path program 2 times 17.97/8.31 [2019-03-29 01:47:18,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1594727234, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:18,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,150 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:18,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:18,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:18,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:18,150 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.97/8.31 [2019-03-29 01:47:18,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:18,151 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:18,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.97/8.31 [2019-03-29 01:47:18,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:18,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:18,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,217 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:18,217 INFO L412 LassoAnalysis]: Checking for nontermination... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,221 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:18,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:18,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=1} Honda state: {ULTIMATE.start_main_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,252 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:18,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:18,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,283 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:18,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.97/8.31 [2019-03-29 01:47:18,309 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: [] 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,313 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,343 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:18,371 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.97/8.31 [2019-03-29 01:47:18,373 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:18,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:18,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:18,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:18,374 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.97/8.31 [2019-03-29 01:47:18,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:18,374 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:18,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.97/8.31 [2019-03-29 01:47:18,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:18,375 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:18,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,431 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:18,431 INFO L497 LassoAnalysis]: Using template 'affine'. 17.97/8.31 [2019-03-29 01:47:18,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:18,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:18,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:18,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:18,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:18,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:18,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:18,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:18,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:18,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:18,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:18,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:18,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:18,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:18,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:18,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:18,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:18,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:18,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:18,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:18,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:18,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:18,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:18,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:18,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:18,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.97/8.31 [2019-03-29 01:47:18,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:18,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:18,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:18,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:18,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:18,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:18,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:18,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:18,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.97/8.31 [2019-03-29 01:47:18,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.97/8.31 [2019-03-29 01:47:18,450 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.97/8.31 [2019-03-29 01:47:18,451 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.97/8.31 [2019-03-29 01:47:18,451 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.97/8.31 [2019-03-29 01:47:18,451 INFO L518 LassoAnalysis]: Proved termination. 17.97/8.31 [2019-03-29 01:47:18,451 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.97/8.31 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 17.97/8.31 Supporting invariants [] 17.97/8.31 [2019-03-29 01:47:18,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.97/8.31 [2019-03-29 01:47:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:18,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:18,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:18,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:18,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.97/8.31 [2019-03-29 01:47:18,492 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.97/8.31 [2019-03-29 01:47:18,493 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 17.97/8.31 [2019-03-29 01:47:18,493 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 81 transitions. cyclomatic complexity: 49 Second operand 3 states. 17.97/8.31 [2019-03-29 01:47:18,527 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 81 transitions. cyclomatic complexity: 49. Second operand 3 states. Result 94 states and 177 transitions. Complement of second has 4 states. 17.97/8.31 [2019-03-29 01:47:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 17.97/8.31 [2019-03-29 01:47:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.97/8.31 [2019-03-29 01:47:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 17.97/8.31 [2019-03-29 01:47:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. 17.97/8.31 [2019-03-29 01:47:18,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 177 transitions. 17.97/8.31 [2019-03-29 01:47:18,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 17.97/8.31 [2019-03-29 01:47:18,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 77 states and 148 transitions. 17.97/8.31 [2019-03-29 01:47:18,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 17.97/8.31 [2019-03-29 01:47:18,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 17.97/8.31 [2019-03-29 01:47:18,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 148 transitions. 17.97/8.31 [2019-03-29 01:47:18,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.97/8.31 [2019-03-29 01:47:18,536 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 148 transitions. 17.97/8.31 [2019-03-29 01:47:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 148 transitions. 17.97/8.31 [2019-03-29 01:47:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. 17.97/8.31 [2019-03-29 01:47:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 17.97/8.31 [2019-03-29 01:47:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 110 transitions. 17.97/8.31 [2019-03-29 01:47:18,542 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 110 transitions. 17.97/8.31 [2019-03-29 01:47:18,542 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 110 transitions. 17.97/8.31 [2019-03-29 01:47:18,542 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.97/8.31 [2019-03-29 01:47:18,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 110 transitions. 17.97/8.31 [2019-03-29 01:47:18,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 17.97/8.31 [2019-03-29 01:47:18,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.97/8.31 [2019-03-29 01:47:18,544 INFO L119 BuchiIsEmpty]: Starting construction of run 17.97/8.31 [2019-03-29 01:47:18,544 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 17.97/8.31 [2019-03-29 01:47:18,544 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.97/8.31 [2019-03-29 01:47:18,545 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~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_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_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_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 463#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 494#L21 [34] L21-->L23: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 464#L23 [37] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_6 |v_ULTIMATE.start_main_#t~nondet6_3|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 465#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 469#L21 [46] L21-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 472#L23-2 17.97/8.31 [2019-03-29 01:47:18,545 INFO L796 eck$LassoCheckResult]: Loop: 472#L23-2 [32] L23-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_9) (< 0 v_ULTIMATE.start_main_~z~0_10) (< 0 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 474#L21 [46] L21-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 472#L23-2 17.97/8.31 [2019-03-29 01:47:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1920126127, now seen corresponding path program 1 times 17.97/8.31 [2019-03-29 01:47:18,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1999, now seen corresponding path program 3 times 17.97/8.31 [2019-03-29 01:47:18,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1594728195, now seen corresponding path program 2 times 17.97/8.31 [2019-03-29 01:47:18,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.97/8.31 [2019-03-29 01:47:18,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.97/8.31 [2019-03-29 01:47:18,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.97/8.31 [2019-03-29 01:47:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.97/8.31 [2019-03-29 01:47:18,590 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:18,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:18,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:18,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:18,591 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.97/8.31 [2019-03-29 01:47:18,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:18,591 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:18,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.97/8.31 [2019-03-29 01:47:18,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:18,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:18,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,643 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:18,643 INFO L412 LassoAnalysis]: Checking for nontermination... 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,646 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.97/8.31 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.97/8.31 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.97/8.31 [2019-03-29 01:47:18,675 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.97/8.31 [2019-03-29 01:47:18,703 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.97/8.31 [2019-03-29 01:47:18,705 INFO L216 LassoAnalysis]: Preferences: 17.97/8.31 [2019-03-29 01:47:18,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.97/8.31 [2019-03-29 01:47:18,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.97/8.31 [2019-03-29 01:47:18,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.97/8.31 [2019-03-29 01:47:18,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.97/8.31 [2019-03-29 01:47:18,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.97/8.31 [2019-03-29 01:47:18,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.97/8.31 [2019-03-29 01:47:18,706 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.97/8.31 [2019-03-29 01:47:18,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.97/8.31 [2019-03-29 01:47:18,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.97/8.31 [2019-03-29 01:47:18,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.97/8.31 [2019-03-29 01:47:18,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.97/8.31 [2019-03-29 01:47:18,760 INFO L300 LassoAnalysis]: Preprocessing complete. 17.97/8.31 [2019-03-29 01:47:18,760 INFO L497 LassoAnalysis]: Using template 'affine'. 17.97/8.31 [2019-03-29 01:47:18,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.97/8.31 Termination analysis: LINEAR_WITH_GUESSES 17.97/8.31 Number of strict supporting invariants: 0 17.97/8.31 Number of non-strict supporting invariants: 1 17.97/8.31 Consider only non-deceasing supporting invariants: true 17.97/8.31 Simplify termination arguments: true 17.97/8.31 Simplify supporting invariants: trueOverapproximate stem: false 17.97/8.31 [2019-03-29 01:47:18,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.97/8.31 [2019-03-29 01:47:18,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.97/8.31 [2019-03-29 01:47:18,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.97/8.31 [2019-03-29 01:47:18,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.97/8.31 [2019-03-29 01:47:18,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.97/8.31 [2019-03-29 01:47:18,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.97/8.31 [2019-03-29 01:47:18,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.97/8.31 [2019-03-29 01:47:18,765 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.97/8.31 [2019-03-29 01:47:18,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.97/8.31 [2019-03-29 01:47:18,767 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.97/8.31 [2019-03-29 01:47:18,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.97/8.31 [2019-03-29 01:47:18,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.97/8.31 [2019-03-29 01:47:18,768 INFO L518 LassoAnalysis]: Proved termination. 17.97/8.31 [2019-03-29 01:47:18,768 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.97/8.31 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 17.97/8.31 Supporting invariants [] 17.97/8.31 [2019-03-29 01:47:18,768 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.97/8.31 [2019-03-29 01:47:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.97/8.31 [2019-03-29 01:47:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:18,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:18,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.97/8.31 [2019-03-29 01:47:18,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.97/8.31 [2019-03-29 01:47:18,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.97/8.31 [2019-03-29 01:47:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.97/8.31 [2019-03-29 01:47:18,812 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.97/8.31 [2019-03-29 01:47:18,812 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 17.97/8.31 [2019-03-29 01:47:18,812 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 55 states and 110 transitions. cyclomatic complexity: 61 Second operand 3 states. 17.97/8.31 [2019-03-29 01:47:18,843 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 55 states and 110 transitions. cyclomatic complexity: 61. Second operand 3 states. Result 138 states and 263 transitions. Complement of second has 4 states. 17.97/8.31 [2019-03-29 01:47:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 17.97/8.31 [2019-03-29 01:47:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.97/8.31 [2019-03-29 01:47:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 17.97/8.31 [2019-03-29 01:47:18,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:18,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. 17.97/8.31 [2019-03-29 01:47:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. 17.97/8.31 [2019-03-29 01:47:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.97/8.31 [2019-03-29 01:47:18,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 263 transitions. 17.97/8.31 [2019-03-29 01:47:18,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.97/8.31 [2019-03-29 01:47:18,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.97/8.31 [2019-03-29 01:47:18,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.97/8.31 [2019-03-29 01:47:18,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.97/8.31 [2019-03-29 01:47:18,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.97/8.31 [2019-03-29 01:47:18,850 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.97/8.31 [2019-03-29 01:47:18,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.97/8.31 [2019-03-29 01:47:18,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:47:18 BasicIcfg 17.97/8.31 [2019-03-29 01:47:18,857 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.97/8.31 [2019-03-29 01:47:18,857 INFO L168 Benchmark]: Toolchain (without parser) took 3876.83 ms. Allocated memory was 649.6 MB in the beginning and 752.9 MB in the end (delta: 103.3 MB). Free memory was 557.4 MB in the beginning and 538.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 122.0 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,859 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.00 ms. Allocated memory is still 649.6 MB. Free memory was 557.4 MB in the beginning and 548.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.69 ms. Allocated memory was 649.6 MB in the beginning and 677.4 MB in the end (delta: 27.8 MB). Free memory was 548.0 MB in the beginning and 642.6 MB in the end (delta: -94.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,861 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 677.4 MB. Free memory was 642.6 MB in the beginning and 640.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,861 INFO L168 Benchmark]: RCFGBuilder took 204.44 ms. Allocated memory is still 677.4 MB. Free memory was 639.5 MB in the beginning and 626.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,862 INFO L168 Benchmark]: BlockEncodingV2 took 78.42 ms. Allocated memory is still 677.4 MB. Free memory was 626.8 MB in the beginning and 621.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,862 INFO L168 Benchmark]: TraceAbstraction took 163.08 ms. Allocated memory is still 677.4 MB. Free memory was 621.4 MB in the beginning and 612.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,863 INFO L168 Benchmark]: BuchiAutomizer took 3083.06 ms. Allocated memory was 677.4 MB in the beginning and 752.9 MB in the end (delta: 75.5 MB). Free memory was 612.0 MB in the beginning and 538.7 MB in the end (delta: 73.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 50.3 GB. 17.97/8.31 [2019-03-29 01:47:18,867 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.97/8.31 --- Results --- 17.97/8.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.97/8.31 - StatisticsResult: Initial Icfg 17.97/8.31 8 locations, 11 edges 17.97/8.31 - StatisticsResult: Encoded RCFG 17.97/8.31 4 locations, 8 edges 17.97/8.31 * Results from de.uni_freiburg.informatik.ultimate.core: 17.97/8.31 - StatisticsResult: Toolchain Benchmarks 17.97/8.31 Benchmark results are: 17.97/8.31 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.97/8.31 * CACSL2BoogieTranslator took 232.00 ms. Allocated memory is still 649.6 MB. Free memory was 557.4 MB in the beginning and 548.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.97/8.31 * Boogie Procedure Inliner took 90.69 ms. Allocated memory was 649.6 MB in the beginning and 677.4 MB in the end (delta: 27.8 MB). Free memory was 548.0 MB in the beginning and 642.6 MB in the end (delta: -94.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 17.97/8.31 * Boogie Preprocessor took 20.01 ms. Allocated memory is still 677.4 MB. Free memory was 642.6 MB in the beginning and 640.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 17.97/8.31 * RCFGBuilder took 204.44 ms. Allocated memory is still 677.4 MB. Free memory was 639.5 MB in the beginning and 626.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 50.3 GB. 17.97/8.31 * BlockEncodingV2 took 78.42 ms. Allocated memory is still 677.4 MB. Free memory was 626.8 MB in the beginning and 621.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.97/8.31 * TraceAbstraction took 163.08 ms. Allocated memory is still 677.4 MB. Free memory was 621.4 MB in the beginning and 612.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 17.97/8.31 * BuchiAutomizer took 3083.06 ms. Allocated memory was 677.4 MB in the beginning and 752.9 MB in the end (delta: 75.5 MB). Free memory was 612.0 MB in the beginning and 538.7 MB in the end (delta: 73.3 MB). Peak memory consumption was 148.8 MB. Max. memory is 50.3 GB. 17.97/8.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.97/8.31 - AllSpecificationsHoldResult: All specifications hold 17.97/8.31 We were not able to verify any specifiation because the program does not contain any specification. 17.97/8.31 - InvariantResult [Line: 20]: Loop Invariant 17.97/8.31 Derived loop invariant: 1 17.97/8.31 - StatisticsResult: Ultimate Automizer benchmark data 17.97/8.31 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 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 17.97/8.31 - StatisticsResult: Constructed decomposition of program 17.97/8.31 Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. 17.97/8.31 - StatisticsResult: Timing statistics 17.97/8.31 BüchiAutomizer plugin needed 3.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 81 SDslu, 24 SDs, 0 SdLazy, 116 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax157 hnf100 lsp30 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 17.97/8.31 - TerminationAnalysisResult: Termination proven 17.97/8.31 Buchi Automizer proved that your program is terminating 17.97/8.31 RESULT: Ultimate proved your program to be correct! 17.97/8.31 !SESSION 2019-03-29 01:47:11.675 ----------------------------------------------- 17.97/8.31 eclipse.buildId=unknown 17.97/8.31 java.version=1.8.0_181 17.97/8.31 java.vendor=Oracle Corporation 17.97/8.31 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.97/8.31 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.97/8.31 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 17.97/8.31 17.97/8.31 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:47:19.099 17.97/8.31 !MESSAGE The workspace will exit with unsaved changes in this session. 17.97/8.31 Received shutdown request... 17.97/8.31 Ultimate: 17.97/8.31 GTK+ Version Check 17.97/8.31 EOF