20.08/8.97 YES 20.08/8.97 20.08/8.97 Ultimate: Cannot open display: 20.08/8.97 This is Ultimate 0.1.24-8dc7c08-m 20.08/8.97 [2019-03-28 12:07:01,546 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.08/8.97 [2019-03-28 12:07:01,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.08/8.97 [2019-03-28 12:07:01,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.08/8.97 [2019-03-28 12:07:01,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.08/8.97 [2019-03-28 12:07:01,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.08/8.97 [2019-03-28 12:07:01,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.08/8.97 [2019-03-28 12:07:01,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.08/8.97 [2019-03-28 12:07:01,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.08/8.97 [2019-03-28 12:07:01,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.08/8.97 [2019-03-28 12:07:01,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.08/8.97 [2019-03-28 12:07:01,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.08/8.97 [2019-03-28 12:07:01,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.08/8.97 [2019-03-28 12:07:01,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.08/8.97 [2019-03-28 12:07:01,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.08/8.97 [2019-03-28 12:07:01,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.08/8.97 [2019-03-28 12:07:01,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.08/8.97 [2019-03-28 12:07:01,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.08/8.97 [2019-03-28 12:07:01,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.08/8.97 [2019-03-28 12:07:01,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.08/8.97 [2019-03-28 12:07:01,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.08/8.97 [2019-03-28 12:07:01,584 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.08/8.97 [2019-03-28 12:07:01,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.08/8.97 [2019-03-28 12:07:01,585 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.08/8.97 [2019-03-28 12:07:01,586 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.08/8.97 [2019-03-28 12:07:01,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.08/8.97 [2019-03-28 12:07:01,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.08/8.97 [2019-03-28 12:07:01,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.08/8.97 [2019-03-28 12:07:01,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.08/8.97 [2019-03-28 12:07:01,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.08/8.97 [2019-03-28 12:07:01,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.08/8.97 [2019-03-28 12:07:01,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.08/8.97 [2019-03-28 12:07:01,592 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 20.08/8.97 [2019-03-28 12:07:01,607 INFO L110 SettingsManager]: Loading preferences was successful 20.08/8.97 [2019-03-28 12:07:01,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.08/8.97 [2019-03-28 12:07:01,608 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.08/8.97 [2019-03-28 12:07:01,608 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.08/8.97 [2019-03-28 12:07:01,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.08/8.97 [2019-03-28 12:07:01,609 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.08/8.97 [2019-03-28 12:07:01,609 INFO L133 SettingsManager]: * Use SBE=true 20.08/8.97 [2019-03-28 12:07:01,609 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.08/8.97 [2019-03-28 12:07:01,609 INFO L133 SettingsManager]: * Use old map elimination=false 20.08/8.97 [2019-03-28 12:07:01,609 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.08/8.97 [2019-03-28 12:07:01,610 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.08/8.97 [2019-03-28 12:07:01,610 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.08/8.97 [2019-03-28 12:07:01,610 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.08/8.97 [2019-03-28 12:07:01,610 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.08/8.97 [2019-03-28 12:07:01,610 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:01,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.08/8.97 [2019-03-28 12:07:01,611 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.08/8.97 [2019-03-28 12:07:01,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.08/8.97 [2019-03-28 12:07:01,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.08/8.97 [2019-03-28 12:07:01,611 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.08/8.97 [2019-03-28 12:07:01,611 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.08/8.97 [2019-03-28 12:07:01,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.08/8.97 [2019-03-28 12:07:01,612 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.08/8.97 [2019-03-28 12:07:01,612 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.08/8.97 [2019-03-28 12:07:01,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.08/8.97 [2019-03-28 12:07:01,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.08/8.97 [2019-03-28 12:07:01,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.08/8.97 [2019-03-28 12:07:01,613 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.08/8.97 [2019-03-28 12:07:01,613 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.08/8.97 [2019-03-28 12:07:01,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.08/8.97 [2019-03-28 12:07:01,654 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.08/8.97 [2019-03-28 12:07:01,657 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.08/8.97 [2019-03-28 12:07:01,659 INFO L271 PluginConnector]: Initializing CDTParser... 20.08/8.97 [2019-03-28 12:07:01,659 INFO L276 PluginConnector]: CDTParser initialized 20.08/8.97 [2019-03-28 12:07:01,660 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 20.08/8.97 [2019-03-28 12:07:01,726 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a72ac732eeb14882aafdd2682b1f7e29/FLAG5603757d5 20.08/8.97 [2019-03-28 12:07:02,064 INFO L307 CDTParser]: Found 1 translation units. 20.08/8.97 [2019-03-28 12:07:02,064 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 20.08/8.97 [2019-03-28 12:07:02,071 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a72ac732eeb14882aafdd2682b1f7e29/FLAG5603757d5 20.08/8.97 [2019-03-28 12:07:02,489 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a72ac732eeb14882aafdd2682b1f7e29 20.08/8.97 [2019-03-28 12:07:02,501 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.08/8.97 [2019-03-28 12:07:02,502 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.08/8.97 [2019-03-28 12:07:02,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.08/8.97 [2019-03-28 12:07:02,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.08/8.97 [2019-03-28 12:07:02,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.08/8.97 [2019-03-28 12:07:02,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479142fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:02,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.08/8.97 [2019-03-28 12:07:02,537 INFO L176 MainTranslator]: Built tables and reachable declarations 20.08/8.97 [2019-03-28 12:07:02,698 INFO L206 PostProcessor]: Analyzing one entry point: main 20.08/8.97 [2019-03-28 12:07:02,703 INFO L191 MainTranslator]: Completed pre-run 20.08/8.97 [2019-03-28 12:07:02,720 INFO L206 PostProcessor]: Analyzing one entry point: main 20.08/8.97 [2019-03-28 12:07:02,735 INFO L195 MainTranslator]: Completed translation 20.08/8.97 [2019-03-28 12:07:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02 WrapperNode 20.08/8.97 [2019-03-28 12:07:02,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.08/8.97 [2019-03-28 12:07:02,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.08/8.97 [2019-03-28 12:07:02,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.08/8.97 [2019-03-28 12:07:02,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.08/8.97 [2019-03-28 12:07:02,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.08/8.97 [2019-03-28 12:07:02,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.08/8.97 [2019-03-28 12:07:02,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.08/8.97 [2019-03-28 12:07:02,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.08/8.97 [2019-03-28 12:07:02,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 [2019-03-28 12:07:02,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.08/8.97 [2019-03-28 12:07:02,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.08/8.97 [2019-03-28 12:07:02,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.08/8.97 [2019-03-28 12:07:02,862 INFO L276 PluginConnector]: RCFGBuilder initialized 20.08/8.97 [2019-03-28 12:07:02,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (1/1) ... 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.08/8.97 [2019-03-28 12:07:02,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.08/8.97 [2019-03-28 12:07:02,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.08/8.97 [2019-03-28 12:07:03,081 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.08/8.97 [2019-03-28 12:07:03,082 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.08/8.97 [2019-03-28 12:07:03,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:03 BoogieIcfgContainer 20.08/8.97 [2019-03-28 12:07:03,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.08/8.97 [2019-03-28 12:07:03,084 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.08/8.97 [2019-03-28 12:07:03,084 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.08/8.97 [2019-03-28 12:07:03,087 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.08/8.97 [2019-03-28 12:07:03,088 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:03" (1/1) ... 20.08/8.97 [2019-03-28 12:07:03,105 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 20.08/8.97 [2019-03-28 12:07:03,106 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.08/8.97 [2019-03-28 12:07:03,107 INFO L263 BlockEncoder]: Using Maximize final states 20.08/8.97 [2019-03-28 12:07:03,108 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.08/8.97 [2019-03-28 12:07:03,108 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.08/8.97 [2019-03-28 12:07:03,116 INFO L296 BlockEncoder]: Using Remove sink states 20.08/8.97 [2019-03-28 12:07:03,117 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.08/8.97 [2019-03-28 12:07:03,117 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.08/8.97 [2019-03-28 12:07:03,135 INFO L185 BlockEncoder]: Using Use SBE 20.08/8.97 [2019-03-28 12:07:03,153 INFO L200 BlockEncoder]: SBE split 4 edges 20.08/8.97 [2019-03-28 12:07:03,158 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.08/8.97 [2019-03-28 12:07:03,160 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.08/8.97 [2019-03-28 12:07:03,169 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.08/8.97 [2019-03-28 12:07:03,171 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 20.08/8.97 [2019-03-28 12:07:03,172 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.08/8.97 [2019-03-28 12:07:03,172 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.08/8.97 [2019-03-28 12:07:03,173 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.08/8.97 [2019-03-28 12:07:03,173 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.08/8.97 [2019-03-28 12:07:03,173 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 20.08/8.97 [2019-03-28 12:07:03,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:03 BasicIcfg 20.08/8.97 [2019-03-28 12:07:03,174 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.08/8.97 [2019-03-28 12:07:03,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.08/8.97 [2019-03-28 12:07:03,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.08/8.97 [2019-03-28 12:07:03,178 INFO L276 PluginConnector]: TraceAbstraction initialized 20.08/8.97 [2019-03-28 12:07:03,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:07:02" (1/4) ... 20.08/8.97 [2019-03-28 12:07:03,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (2/4) ... 20.08/8.97 [2019-03-28 12:07:03,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:03" (3/4) ... 20.08/8.97 [2019-03-28 12:07:03,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:03" (4/4) ... 20.08/8.97 [2019-03-28 12:07:03,183 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.08/8.97 [2019-03-28 12:07:03,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.08/8.97 [2019-03-28 12:07:03,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.08/8.97 [2019-03-28 12:07:03,219 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.08/8.97 [2019-03-28 12:07:03,251 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.08/8.97 [2019-03-28 12:07:03,252 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.08/8.97 [2019-03-28 12:07:03,252 INFO L383 AbstractCegarLoop]: Hoare is true 20.08/8.97 [2019-03-28 12:07:03,252 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.08/8.97 [2019-03-28 12:07:03,252 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.08/8.97 [2019-03-28 12:07:03,253 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.08/8.97 [2019-03-28 12:07:03,253 INFO L387 AbstractCegarLoop]: Difference is false 20.08/8.97 [2019-03-28 12:07:03,253 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.08/8.97 [2019-03-28 12:07:03,253 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.08/8.97 [2019-03-28 12:07:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 20.08/8.97 [2019-03-28 12:07:03,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.08/8.97 [2019-03-28 12:07:03,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 20.08/8.97 [2019-03-28 12:07:03,326 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 27) no Hoare annotation was computed. 20.08/8.97 [2019-03-28 12:07:03,327 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.08/8.97 [2019-03-28 12:07:03,327 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. 20.08/8.97 [2019-03-28 12:07:03,327 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 16 28) the Hoare annotation is: true 20.08/8.97 [2019-03-28 12:07:03,327 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. 20.08/8.97 [2019-03-28 12:07:03,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:03 BasicIcfg 20.08/8.97 [2019-03-28 12:07:03,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.08/8.97 [2019-03-28 12:07:03,337 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.08/8.97 [2019-03-28 12:07:03,337 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.08/8.97 [2019-03-28 12:07:03,340 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.08/8.97 [2019-03-28 12:07:03,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.08/8.97 [2019-03-28 12:07:03,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:07:02" (1/5) ... 20.08/8.97 [2019-03-28 12:07:03,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c882afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.08/8.97 [2019-03-28 12:07:03,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:02" (2/5) ... 20.08/8.97 [2019-03-28 12:07:03,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c882afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.08/8.97 [2019-03-28 12:07:03,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:03" (3/5) ... 20.08/8.97 [2019-03-28 12:07:03,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c882afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.08/8.97 [2019-03-28 12:07:03,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:03" (4/5) ... 20.08/8.97 [2019-03-28 12:07:03,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c882afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:03, skipping insertion in model container 20.08/8.97 [2019-03-28 12:07:03,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.08/8.97 [2019-03-28 12:07:03,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:03" (5/5) ... 20.08/8.97 [2019-03-28 12:07:03,346 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.08/8.97 [2019-03-28 12:07:03,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.08/8.97 [2019-03-28 12:07:03,372 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.08/8.97 [2019-03-28 12:07:03,372 INFO L375 BuchiCegarLoop]: Hoare is true 20.08/8.97 [2019-03-28 12:07:03,372 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.08/8.97 [2019-03-28 12:07:03,373 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.08/8.97 [2019-03-28 12:07:03,373 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.08/8.97 [2019-03-28 12:07:03,373 INFO L379 BuchiCegarLoop]: Difference is false 20.08/8.97 [2019-03-28 12:07:03,373 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.08/8.97 [2019-03-28 12:07:03,373 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.08/8.97 [2019-03-28 12:07:03,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 20.08/8.97 [2019-03-28 12:07:03,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.08/8.97 [2019-03-28 12:07:03,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.97 [2019-03-28 12:07:03,395 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.97 [2019-03-28 12:07:03,402 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.08/8.97 [2019-03-28 12:07:03,402 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:03,402 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.08/8.97 [2019-03-28 12:07:03,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 20.08/8.97 [2019-03-28 12:07:03,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.08/8.97 [2019-03-28 12:07:03,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.97 [2019-03-28 12:07:03,404 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.97 [2019-03-28 12:07:03,404 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.08/8.97 [2019-03-28 12:07:03,404 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:03,409 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 3#L23-2true 20.08/8.97 [2019-03-28 12:07:03,410 INFO L796 eck$LassoCheckResult]: Loop: 3#L23-2true [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 5#L17true [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 6#L23true [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 3#L23-2true 20.08/8.97 [2019-03-28 12:07:03,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:03,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:03,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:03,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:03,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2092883, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:03,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:03,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:03,583 INFO L216 LassoAnalysis]: Preferences: 20.08/8.97 [2019-03-28 12:07:03,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.97 [2019-03-28 12:07:03,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.97 [2019-03-28 12:07:03,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.97 [2019-03-28 12:07:03,584 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.97 [2019-03-28 12:07:03,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:03,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.97 [2019-03-28 12:07:03,585 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.97 [2019-03-28 12:07:03,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.08/8.97 [2019-03-28 12:07:03,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.97 [2019-03-28 12:07:03,586 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.97 [2019-03-28 12:07:03,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,705 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.97 [2019-03-28 12:07:03,705 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:03,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:03,711 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:03,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:03,744 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:03,779 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.97 [2019-03-28 12:07:03,781 INFO L216 LassoAnalysis]: Preferences: 20.08/8.97 [2019-03-28 12:07:03,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.97 [2019-03-28 12:07:03,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.97 [2019-03-28 12:07:03,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.97 [2019-03-28 12:07:03,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.97 [2019-03-28 12:07:03,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:03,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.97 [2019-03-28 12:07:03,782 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.97 [2019-03-28 12:07:03,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.08/8.97 [2019-03-28 12:07:03,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.97 [2019-03-28 12:07:03,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.97 [2019-03-28 12:07:03,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:03,890 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.97 [2019-03-28 12:07:03,896 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.97 [2019-03-28 12:07:03,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:03,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.97 [2019-03-28 12:07:03,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.97 [2019-03-28 12:07:03,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.97 [2019-03-28 12:07:03,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.97 [2019-03-28 12:07:03,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.97 [2019-03-28 12:07:03,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.97 [2019-03-28 12:07:03,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.97 [2019-03-28 12:07:03,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.97 [2019-03-28 12:07:03,918 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.97 [2019-03-28 12:07:03,918 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.08/8.97 [2019-03-28 12:07:03,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.97 [2019-03-28 12:07:03,921 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.97 [2019-03-28 12:07:03,922 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.97 [2019-03-28 12:07:03,922 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.97 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.08/8.97 Supporting invariants [] 20.08/8.97 [2019-03-28 12:07:03,924 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.97 [2019-03-28 12:07:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.97 [2019-03-28 12:07:03,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.97 [2019-03-28 12:07:03,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.97 [2019-03-28 12:07:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.97 [2019-03-28 12:07:03,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.97 [2019-03-28 12:07:03,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.97 [2019-03-28 12:07:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.97 [2019-03-28 12:07:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.97 [2019-03-28 12:07:04,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.97 [2019-03-28 12:07:04,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.97 [2019-03-28 12:07:04,071 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.97 [2019-03-28 12:07:04,076 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 20.08/8.97 [2019-03-28 12:07:04,078 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. 20.08/8.97 [2019-03-28 12:07:04,141 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 8 states. 20.08/8.97 [2019-03-28 12:07:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.08/8.97 [2019-03-28 12:07:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.08/8.97 [2019-03-28 12:07:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.08/8.97 [2019-03-28 12:07:04,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 3 letters. 20.08/8.97 [2019-03-28 12:07:04,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.97 [2019-03-28 12:07:04,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.08/8.97 [2019-03-28 12:07:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.97 [2019-03-28 12:07:04,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 6 letters. 20.08/8.97 [2019-03-28 12:07:04,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.97 [2019-03-28 12:07:04,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. 20.08/8.97 [2019-03-28 12:07:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 20.08/8.97 [2019-03-28 12:07:04,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 32 transitions. 20.08/8.97 [2019-03-28 12:07:04,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 20.08/8.97 [2019-03-28 12:07:04,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 20.08/8.97 [2019-03-28 12:07:04,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 32 transitions. 20.08/8.97 [2019-03-28 12:07:04,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.97 [2019-03-28 12:07:04,165 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 32 transitions. 20.08/8.97 [2019-03-28 12:07:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 32 transitions. 20.08/8.97 [2019-03-28 12:07:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. 20.08/8.97 [2019-03-28 12:07:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.08/8.97 [2019-03-28 12:07:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. 20.08/8.97 [2019-03-28 12:07:04,196 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 20.08/8.97 [2019-03-28 12:07:04,196 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 20.08/8.97 [2019-03-28 12:07:04,197 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.08/8.97 [2019-03-28 12:07:04,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. 20.08/8.97 [2019-03-28 12:07:04,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.08/8.97 [2019-03-28 12:07:04,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.97 [2019-03-28 12:07:04,198 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.97 [2019-03-28 12:07:04,198 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:04,198 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:04,199 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 77#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 73#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 78#L19 20.08/8.97 [2019-03-28 12:07:04,199 INFO L796 eck$LassoCheckResult]: Loop: 78#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 81#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 82#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 78#L19 20.08/8.97 [2019-03-28 12:07:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:04,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:04,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 85754, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:04,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:04,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.97 [2019-03-28 12:07:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.97 [2019-03-28 12:07:04,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.08/8.97 [2019-03-28 12:07:04,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 20.08/8.97 [2019-03-28 12:07:04,254 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.08/8.97 [2019-03-28 12:07:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.08/8.97 [2019-03-28 12:07:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.08/8.97 [2019-03-28 12:07:04,258 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 15 Second operand 3 states. 20.08/8.97 [2019-03-28 12:07:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.08/8.97 [2019-03-28 12:07:04,284 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. 20.08/8.97 [2019-03-28 12:07:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.08/8.97 [2019-03-28 12:07:04,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 38 transitions. 20.08/8.97 [2019-03-28 12:07:04,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.08/8.97 [2019-03-28 12:07:04,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.08/8.97 [2019-03-28 12:07:04,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 20.08/8.97 [2019-03-28 12:07:04,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.97 [2019-03-28 12:07:04,290 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 20.08/8.97 [2019-03-28 12:07:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 20.08/8.97 [2019-03-28 12:07:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,293 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,293 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,293 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.08/8.97 [2019-03-28 12:07:04,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 36 transitions. 20.08/8.97 [2019-03-28 12:07:04,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.08/8.97 [2019-03-28 12:07:04,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.97 [2019-03-28 12:07:04,294 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.97 [2019-03-28 12:07:04,294 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:04,294 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.97 [2019-03-28 12:07:04,295 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 113#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 109#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 121#L19 20.08/8.97 [2019-03-28 12:07:04,295 INFO L796 eck$LassoCheckResult]: Loop: 121#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 118#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 124#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 121#L19 20.08/8.97 [2019-03-28 12:07:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 2 times 20.08/8.97 [2019-03-28 12:07:04,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash 74222, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:04,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:04,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.97 [2019-03-28 12:07:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2010787976, now seen corresponding path program 1 times 20.08/8.97 [2019-03-28 12:07:04,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.97 [2019-03-28 12:07:04,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.97 [2019-03-28 12:07:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.97 [2019-03-28 12:07:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.97 [2019-03-28 12:07:04,363 INFO L216 LassoAnalysis]: Preferences: 20.08/8.97 [2019-03-28 12:07:04,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.97 [2019-03-28 12:07:04,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.97 [2019-03-28 12:07:04,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.97 [2019-03-28 12:07:04,364 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.97 [2019-03-28 12:07:04,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.97 [2019-03-28 12:07:04,364 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.97 [2019-03-28 12:07:04,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.08/8.97 [2019-03-28 12:07:04,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.97 [2019-03-28 12:07:04,364 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.97 [2019-03-28 12:07:04,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,442 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.97 [2019-03-28 12:07:04,442 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,455 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:04,462 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.97 [2019-03-28 12:07:04,462 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,491 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:04,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.97 [2019-03-28 12:07:04,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,525 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:04,530 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.97 [2019-03-28 12:07:04,530 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,561 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:04,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.97 [2019-03-28 12:07:04,565 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,594 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.97 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.97 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.97 [2019-03-28 12:07:04,626 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.97 [2019-03-28 12:07:04,676 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.97 [2019-03-28 12:07:04,680 INFO L216 LassoAnalysis]: Preferences: 20.08/8.97 [2019-03-28 12:07:04,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.97 [2019-03-28 12:07:04,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.97 [2019-03-28 12:07:04,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.97 [2019-03-28 12:07:04,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.97 [2019-03-28 12:07:04,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.97 [2019-03-28 12:07:04,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.97 [2019-03-28 12:07:04,682 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.97 [2019-03-28 12:07:04,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.08/8.97 [2019-03-28 12:07:04,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.97 [2019-03-28 12:07:04,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.97 [2019-03-28 12:07:04,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.97 [2019-03-28 12:07:04,778 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.97 [2019-03-28 12:07:04,778 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.97 [2019-03-28 12:07:04,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:04,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.97 [2019-03-28 12:07:04,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.97 [2019-03-28 12:07:04,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.97 [2019-03-28 12:07:04,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.97 [2019-03-28 12:07:04,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.97 [2019-03-28 12:07:04,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.97 [2019-03-28 12:07:04,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.97 [2019-03-28 12:07:04,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.97 [2019-03-28 12:07:04,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:04,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.97 [2019-03-28 12:07:04,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.97 [2019-03-28 12:07:04,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.97 [2019-03-28 12:07:04,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.97 [2019-03-28 12:07:04,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.97 [2019-03-28 12:07:04,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.97 [2019-03-28 12:07:04,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.97 [2019-03-28 12:07:04,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.97 [2019-03-28 12:07:04,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:04,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.97 [2019-03-28 12:07:04,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.97 [2019-03-28 12:07:04,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.97 [2019-03-28 12:07:04,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.97 [2019-03-28 12:07:04,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.97 [2019-03-28 12:07:04,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.97 [2019-03-28 12:07:04,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.97 [2019-03-28 12:07:04,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.97 [2019-03-28 12:07:04,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:04,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.97 [2019-03-28 12:07:04,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.97 [2019-03-28 12:07:04,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.97 [2019-03-28 12:07:04,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.97 [2019-03-28 12:07:04,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.97 [2019-03-28 12:07:04,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.97 [2019-03-28 12:07:04,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.97 [2019-03-28 12:07:04,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.97 [2019-03-28 12:07:04,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.97 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.97 Number of strict supporting invariants: 0 20.08/8.97 Number of non-strict supporting invariants: 1 20.08/8.97 Consider only non-deceasing supporting invariants: true 20.08/8.97 Simplify termination arguments: true 20.08/8.97 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.97 [2019-03-28 12:07:04,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:04,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:04,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:04,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:04,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:04,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:04,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:04,802 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.98 [2019-03-28 12:07:04,807 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.98 [2019-03-28 12:07:04,807 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.08/8.98 [2019-03-28 12:07:04,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.98 [2019-03-28 12:07:04,807 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.98 [2019-03-28 12:07:04,808 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.98 [2019-03-28 12:07:04,808 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.98 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~y~0 + 1 20.08/8.98 Supporting invariants [] 20.08/8.98 [2019-03-28 12:07:04,808 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.98 [2019-03-28 12:07:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:04,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:04,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:04,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:04,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:04,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:04,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:04,890 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.98 [2019-03-28 12:07:04,890 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 20.08/8.98 [2019-03-28 12:07:04,891 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 21 Second operand 4 states. 20.08/8.98 [2019-03-28 12:07:04,958 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 32 states and 67 transitions. Complement of second has 8 states. 20.08/8.98 [2019-03-28 12:07:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.08/8.98 [2019-03-28 12:07:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.08/8.98 [2019-03-28 12:07:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.08/8.98 [2019-03-28 12:07:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:04,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 67 transitions. 20.08/8.98 [2019-03-28 12:07:04,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 20.08/8.98 [2019-03-28 12:07:04,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 48 transitions. 20.08/8.98 [2019-03-28 12:07:04,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.08/8.98 [2019-03-28 12:07:04,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 20.08/8.98 [2019-03-28 12:07:04,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 48 transitions. 20.08/8.98 [2019-03-28 12:07:04,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:04,967 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 48 transitions. 20.08/8.98 [2019-03-28 12:07:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 48 transitions. 20.08/8.98 [2019-03-28 12:07:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 20.08/8.98 [2019-03-28 12:07:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 20.08/8.98 [2019-03-28 12:07:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. 20.08/8.98 [2019-03-28 12:07:04,970 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 46 transitions. 20.08/8.98 [2019-03-28 12:07:04,971 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 46 transitions. 20.08/8.98 [2019-03-28 12:07:04,971 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.08/8.98 [2019-03-28 12:07:04,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 46 transitions. 20.08/8.98 [2019-03-28 12:07:04,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:04,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.98 [2019-03-28 12:07:04,972 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.98 [2019-03-28 12:07:04,972 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.08/8.98 [2019-03-28 12:07:04,973 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:04,973 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 214#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 225#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 221#L19 20.08/8.98 [2019-03-28 12:07:04,973 INFO L796 eck$LassoCheckResult]: Loop: 221#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 209#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 210#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 215#L23 [59] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_7 0) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet7_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_3|} OutVars{ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 218#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 229#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 221#L19 20.08/8.98 [2019-03-28 12:07:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 3 times 20.08/8.98 [2019-03-28 12:07:04,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:04,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1739735341, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:04,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1819800057, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:04,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:04,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,085 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:05,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:05,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:05,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:05,086 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.98 [2019-03-28 12:07:05,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:05,087 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:05,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.08/8.98 [2019-03-28 12:07:05,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:05,087 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:05,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,177 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:05,178 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,183 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,187 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,214 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,218 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,218 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,246 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,277 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~n~0=1} Honda state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~n~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,309 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,341 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,397 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.98 [2019-03-28 12:07:05,399 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:05,399 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:05,399 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:05,399 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:05,399 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.98 [2019-03-28 12:07:05,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:05,400 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:05,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.08/8.98 [2019-03-28 12:07:05,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:05,400 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:05,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,539 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:05,539 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.98 [2019-03-28 12:07:05,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:05,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:05,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:05,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:05,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:05,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:05,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:05,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:05,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:05,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:05,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:05,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:05,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:05,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:05,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:05,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:05,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:05,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:05,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:05,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:05,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:05,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:05,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:05,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:05,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:05,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:05,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:05,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:05,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:05,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:05,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:05,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:05,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:05,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:05,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:05,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:05,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:05,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:05,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:05,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:05,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:05,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:05,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:05,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:05,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.98 [2019-03-28 12:07:05,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.98 [2019-03-28 12:07:05,563 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.08/8.98 [2019-03-28 12:07:05,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.98 [2019-03-28 12:07:05,564 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.98 [2019-03-28 12:07:05,564 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.98 [2019-03-28 12:07:05,564 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.98 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.08/8.98 Supporting invariants [] 20.08/8.98 [2019-03-28 12:07:05,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.98 [2019-03-28 12:07:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:05,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:05,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:05,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:05,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:05,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:05,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:05,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:05,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:05,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:05,688 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.98 [2019-03-28 12:07:05,688 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 20.08/8.98 [2019-03-28 12:07:05,688 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 46 transitions. cyclomatic complexity: 26 Second operand 5 states. 20.08/8.98 [2019-03-28 12:07:05,732 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 46 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 57 states and 107 transitions. Complement of second has 12 states. 20.08/8.98 [2019-03-28 12:07:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 20.08/8.98 [2019-03-28 12:07:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.08/8.98 [2019-03-28 12:07:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 20.08/8.98 [2019-03-28 12:07:05,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:05,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:05,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:05,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:05,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 12 letters. 20.08/8.98 [2019-03-28 12:07:05,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:05,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 107 transitions. 20.08/8.98 [2019-03-28 12:07:05,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 20.08/8.98 [2019-03-28 12:07:05,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 48 states and 91 transitions. 20.08/8.98 [2019-03-28 12:07:05,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 20.08/8.98 [2019-03-28 12:07:05,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.08/8.98 [2019-03-28 12:07:05,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 91 transitions. 20.08/8.98 [2019-03-28 12:07:05,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:05,742 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 91 transitions. 20.08/8.98 [2019-03-28 12:07:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 91 transitions. 20.08/8.98 [2019-03-28 12:07:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. 20.08/8.98 [2019-03-28 12:07:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 20.08/8.98 [2019-03-28 12:07:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. 20.08/8.98 [2019-03-28 12:07:05,747 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 73 transitions. 20.08/8.98 [2019-03-28 12:07:05,747 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 73 transitions. 20.08/8.98 [2019-03-28 12:07:05,747 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.08/8.98 [2019-03-28 12:07:05,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 73 transitions. 20.08/8.98 [2019-03-28 12:07:05,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:05,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.98 [2019-03-28 12:07:05,749 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.98 [2019-03-28 12:07:05,749 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:05,749 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.98 [2019-03-28 12:07:05,749 INFO L794 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 397#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 410#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 411#L19 [58] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 402#L23-2 20.08/8.98 [2019-03-28 12:07:05,750 INFO L796 eck$LassoCheckResult]: Loop: 402#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 398#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 399#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 402#L23-2 20.08/8.98 [2019-03-28 12:07:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2092403, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 2 times 20.08/8.98 [2019-03-28 12:07:05,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:05,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:05,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2089694363, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:05,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:05,801 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:05,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:05,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:05,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:05,801 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.98 [2019-03-28 12:07:05,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:05,802 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:05,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.08/8.98 [2019-03-28 12:07:05,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:05,802 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:05,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,852 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:05,852 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,856 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,884 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,889 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,892 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:05,893 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=0} Honda state: {ULTIMATE.start_main_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,921 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:05,952 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:05,984 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.98 [2019-03-28 12:07:05,986 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:05,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:05,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:05,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:05,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.98 [2019-03-28 12:07:05,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:05,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:05,987 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:05,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.08/8.98 [2019-03-28 12:07:05,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:05,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:05,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:05,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,041 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:06,041 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.98 [2019-03-28 12:07:06,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:06,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:06,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.98 [2019-03-28 12:07:06,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.98 [2019-03-28 12:07:06,055 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.08/8.98 [2019-03-28 12:07:06,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.98 [2019-03-28 12:07:06,055 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.98 [2019-03-28 12:07:06,055 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.98 [2019-03-28 12:07:06,056 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.98 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.08/8.98 Supporting invariants [] 20.08/8.98 [2019-03-28 12:07:06,056 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.98 [2019-03-28 12:07:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,125 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.98 [2019-03-28 12:07:06,125 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 20.08/8.98 [2019-03-28 12:07:06,125 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 73 transitions. cyclomatic complexity: 42 Second operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,174 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 73 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 103 states and 174 transitions. Complement of second has 14 states. 20.08/8.98 [2019-03-28 12:07:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.08/8.98 [2019-03-28 12:07:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.08/8.98 [2019-03-28 12:07:06,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:06,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 174 transitions. 20.08/8.98 [2019-03-28 12:07:06,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:06,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 126 transitions. 20.08/8.98 [2019-03-28 12:07:06,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 20.08/8.98 [2019-03-28 12:07:06,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 20.08/8.98 [2019-03-28 12:07:06,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 126 transitions. 20.08/8.98 [2019-03-28 12:07:06,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:06,186 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 126 transitions. 20.08/8.98 [2019-03-28 12:07:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 126 transitions. 20.08/8.98 [2019-03-28 12:07:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. 20.08/8.98 [2019-03-28 12:07:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.08/8.98 [2019-03-28 12:07:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. 20.08/8.98 [2019-03-28 12:07:06,191 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 97 transitions. 20.08/8.98 [2019-03-28 12:07:06,191 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 97 transitions. 20.08/8.98 [2019-03-28 12:07:06,191 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.08/8.98 [2019-03-28 12:07:06,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 97 transitions. 20.08/8.98 [2019-03-28 12:07:06,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:06,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.98 [2019-03-28 12:07:06,193 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.98 [2019-03-28 12:07:06,193 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,193 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,194 INFO L794 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 596#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 634#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 633#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 602#L23-2 20.08/8.98 [2019-03-28 12:07:06,194 INFO L796 eck$LassoCheckResult]: Loop: 602#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 612#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 601#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 602#L23-2 20.08/8.98 [2019-03-28 12:07:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2092402, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:06,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 3 times 20.08/8.98 [2019-03-28 12:07:06,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2089724154, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:06,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,246 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:06,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:06,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:06,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:06,247 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.98 [2019-03-28 12:07:06,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:06,247 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:06,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.08/8.98 [2019-03-28 12:07:06,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:06,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:06,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,298 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:06,298 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:06,304 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:06,338 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:06,370 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.98 [2019-03-28 12:07:06,372 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:06,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:06,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:06,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:06,373 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.98 [2019-03-28 12:07:06,373 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,373 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:06,373 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:06,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.08/8.98 [2019-03-28 12:07:06,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:06,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:06,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,422 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:06,422 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.98 [2019-03-28 12:07:06,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.98 [2019-03-28 12:07:06,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.98 [2019-03-28 12:07:06,430 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.08/8.98 [2019-03-28 12:07:06,430 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.98 [2019-03-28 12:07:06,430 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.98 [2019-03-28 12:07:06,430 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.98 [2019-03-28 12:07:06,431 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.98 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.08/8.98 Supporting invariants [] 20.08/8.98 [2019-03-28 12:07:06,431 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.98 [2019-03-28 12:07:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,490 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.98 [2019-03-28 12:07:06,491 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 20.08/8.98 [2019-03-28 12:07:06,491 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 97 transitions. cyclomatic complexity: 53 Second operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,534 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 97 transitions. cyclomatic complexity: 53. Second operand 4 states. Result 113 states and 191 transitions. Complement of second has 14 states. 20.08/8.98 [2019-03-28 12:07:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.08/8.98 [2019-03-28 12:07:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.08/8.98 [2019-03-28 12:07:06,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:06,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 191 transitions. 20.08/8.98 [2019-03-28 12:07:06,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:06,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 81 states and 146 transitions. 20.08/8.98 [2019-03-28 12:07:06,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 20.08/8.98 [2019-03-28 12:07:06,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 20.08/8.98 [2019-03-28 12:07:06,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 146 transitions. 20.08/8.98 [2019-03-28 12:07:06,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:06,543 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 146 transitions. 20.08/8.98 [2019-03-28 12:07:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 146 transitions. 20.08/8.98 [2019-03-28 12:07:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. 20.08/8.98 [2019-03-28 12:07:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.08/8.98 [2019-03-28 12:07:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. 20.08/8.98 [2019-03-28 12:07:06,548 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 94 transitions. 20.08/8.98 [2019-03-28 12:07:06,548 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 94 transitions. 20.08/8.98 [2019-03-28 12:07:06,548 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 20.08/8.98 [2019-03-28 12:07:06,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 94 transitions. 20.08/8.98 [2019-03-28 12:07:06,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 20.08/8.98 [2019-03-28 12:07:06,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.98 [2019-03-28 12:07:06,549 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.98 [2019-03-28 12:07:06,550 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,550 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,550 INFO L794 eck$LassoCheckResult]: Stem: 818#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 819#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 852#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 851#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 828#L23-2 20.08/8.98 [2019-03-28 12:07:06,550 INFO L796 eck$LassoCheckResult]: Loop: 828#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 833#L17 [56] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (> 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 834#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 838#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 835#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 826#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 828#L23-2 20.08/8.98 [2019-03-28 12:07:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2092390, now seen corresponding path program 2 times 20.08/8.98 [2019-03-28 12:07:06,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1999787477, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:06,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:06,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.08/8.98 [2019-03-28 12:07:06,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.08/8.98 [2019-03-28 12:07:06,572 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.08/8.98 [2019-03-28 12:07:06,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.08/8.98 [2019-03-28 12:07:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.08/8.98 [2019-03-28 12:07:06,573 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. cyclomatic complexity: 50 Second operand 3 states. 20.08/8.98 [2019-03-28 12:07:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.08/8.98 [2019-03-28 12:07:06,597 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. 20.08/8.98 [2019-03-28 12:07:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.08/8.98 [2019-03-28 12:07:06,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 101 transitions. 20.08/8.98 [2019-03-28 12:07:06,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.08/8.98 [2019-03-28 12:07:06,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 20.08/8.98 [2019-03-28 12:07:06,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 20.08/8.98 [2019-03-28 12:07:06,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:06,601 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. 20.08/8.98 [2019-03-28 12:07:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.08/8.98 [2019-03-28 12:07:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,605 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,605 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,606 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 20.08/8.98 [2019-03-28 12:07:06,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 90 transitions. 20.08/8.98 [2019-03-28 12:07:06,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.08/8.98 [2019-03-28 12:07:06,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.08/8.98 [2019-03-28 12:07:06,607 INFO L119 BuchiIsEmpty]: Starting construction of run 20.08/8.98 [2019-03-28 12:07:06,607 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,607 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.08/8.98 [2019-03-28 12:07:06,608 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_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~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 933#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 929#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 949#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 944#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 954#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 937#L23 20.08/8.98 [2019-03-28 12:07:06,608 INFO L796 eck$LassoCheckResult]: Loop: 937#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 938#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 953#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 937#L23 20.08/8.98 [2019-03-28 12:07:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2010787992, now seen corresponding path program 1 times 20.08/8.98 [2019-03-28 12:07:06,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:06,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.08/8.98 [2019-03-28 12:07:06,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.08/8.98 [2019-03-28 12:07:06,628 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.08/8.98 [2019-03-28 12:07:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash 71355, now seen corresponding path program 4 times 20.08/8.98 [2019-03-28 12:07:06,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.08/8.98 [2019-03-28 12:07:06,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.08/8.98 [2019-03-28 12:07:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.08/8.98 [2019-03-28 12:07:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.08/8.98 [2019-03-28 12:07:06,654 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:06,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:06,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:06,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:06,655 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.08/8.98 [2019-03-28 12:07:06,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:06,655 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:06,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 20.08/8.98 [2019-03-28 12:07:06,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:06,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:06,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,699 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:06,700 INFO L412 LassoAnalysis]: Checking for nontermination... 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:06,703 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:06,707 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.08/8.98 [2019-03-28 12:07:06,707 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=0} Honda state: {ULTIMATE.start_main_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:06,734 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.08/8.98 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.08/8.98 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.08/8.98 [2019-03-28 12:07:06,763 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.08/8.98 [2019-03-28 12:07:06,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.08/8.98 [2019-03-28 12:07:06,795 INFO L216 LassoAnalysis]: Preferences: 20.08/8.98 [2019-03-28 12:07:06,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.08/8.98 [2019-03-28 12:07:06,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.08/8.98 [2019-03-28 12:07:06,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.08/8.98 [2019-03-28 12:07:06,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.08/8.98 [2019-03-28 12:07:06,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.08/8.98 [2019-03-28 12:07:06,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.08/8.98 [2019-03-28 12:07:06,796 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.08/8.98 [2019-03-28 12:07:06,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 20.08/8.98 [2019-03-28 12:07:06,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.08/8.98 [2019-03-28 12:07:06,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.08/8.98 [2019-03-28 12:07:06,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.08/8.98 [2019-03-28 12:07:06,844 INFO L300 LassoAnalysis]: Preprocessing complete. 20.08/8.98 [2019-03-28 12:07:06,844 INFO L497 LassoAnalysis]: Using template 'affine'. 20.08/8.98 [2019-03-28 12:07:06,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.08/8.98 [2019-03-28 12:07:06,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.08/8.98 Termination analysis: LINEAR_WITH_GUESSES 20.08/8.98 Number of strict supporting invariants: 0 20.08/8.98 Number of non-strict supporting invariants: 1 20.08/8.98 Consider only non-deceasing supporting invariants: true 20.08/8.98 Simplify termination arguments: true 20.08/8.98 Simplify supporting invariants: trueOverapproximate stem: false 20.08/8.98 [2019-03-28 12:07:06,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.08/8.98 [2019-03-28 12:07:06,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.08/8.98 [2019-03-28 12:07:06,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.08/8.98 [2019-03-28 12:07:06,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.08/8.98 [2019-03-28 12:07:06,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.08/8.98 [2019-03-28 12:07:06,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.08/8.98 [2019-03-28 12:07:06,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.08/8.98 [2019-03-28 12:07:06,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.08/8.98 [2019-03-28 12:07:06,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.08/8.98 [2019-03-28 12:07:06,854 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.08/8.98 [2019-03-28 12:07:06,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.08/8.98 [2019-03-28 12:07:06,855 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.08/8.98 [2019-03-28 12:07:06,855 INFO L518 LassoAnalysis]: Proved termination. 20.08/8.98 [2019-03-28 12:07:06,855 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.08/8.98 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.08/8.98 Supporting invariants [] 20.08/8.98 [2019-03-28 12:07:06,855 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.08/8.98 [2019-03-28 12:07:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.08/8.98 [2019-03-28 12:07:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.08/8.98 [2019-03-28 12:07:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.08/8.98 [2019-03-28 12:07:06,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.08/8.98 [2019-03-28 12:07:06,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.08/8.98 [2019-03-28 12:07:06,918 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.08/8.98 [2019-03-28 12:07:06,919 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.08/8.98 [2019-03-28 12:07:06,919 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46 Second operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,963 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46. Second operand 4 states. Result 132 states and 226 transitions. Complement of second has 8 states. 20.08/8.98 [2019-03-28 12:07:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.08/8.98 [2019-03-28 12:07:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.08/8.98 [2019-03-28 12:07:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. 20.08/8.98 [2019-03-28 12:07:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. 20.08/8.98 [2019-03-28 12:07:06,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. 20.08/8.98 [2019-03-28 12:07:06,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.08/8.98 [2019-03-28 12:07:06,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. 20.08/8.98 [2019-03-28 12:07:06,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.08/8.98 [2019-03-28 12:07:06,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 78 states and 141 transitions. 20.08/8.98 [2019-03-28 12:07:06,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 20.08/8.98 [2019-03-28 12:07:06,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.08/8.98 [2019-03-28 12:07:06,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 141 transitions. 20.08/8.98 [2019-03-28 12:07:06,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.08/8.98 [2019-03-28 12:07:06,971 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 141 transitions. 20.08/8.98 [2019-03-28 12:07:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 141 transitions. 20.08/8.98 [2019-03-28 12:07:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. 20.08/8.98 [2019-03-28 12:07:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 20.08/8.98 [2019-03-28 12:07:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 78 transitions. 20.08/8.98 [2019-03-28 12:07:06,975 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 78 transitions. 20.08/8.98 [2019-03-28 12:07:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.08/8.98 [2019-03-28 12:07:06,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.08/8.98 [2019-03-28 12:07:06,975 INFO L87 Difference]: Start difference. First operand 41 states and 78 transitions. Second operand 3 states. 20.08/8.98 [2019-03-28 12:07:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.08/8.98 [2019-03-28 12:07:06,989 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. 20.08/8.98 [2019-03-28 12:07:06,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.08/8.98 [2019-03-28 12:07:06,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. 20.08/8.98 [2019-03-28 12:07:06,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.08/8.98 [2019-03-28 12:07:06,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.08/8.98 [2019-03-28 12:07:06,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.08/8.98 [2019-03-28 12:07:06,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,992 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 20.08/8.98 [2019-03-28 12:07:06,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.08/8.98 [2019-03-28 12:07:06,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.08/8.98 [2019-03-28 12:07:06,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.08/8.98 [2019-03-28 12:07:06,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:06 BasicIcfg 20.08/8.98 [2019-03-28 12:07:06,999 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.08/8.98 [2019-03-28 12:07:07,000 INFO L168 Benchmark]: Toolchain (without parser) took 4498.45 ms. Allocated memory was 649.6 MB in the beginning and 757.1 MB in the end (delta: 107.5 MB). Free memory was 563.5 MB in the beginning and 437.9 MB in the end (delta: 125.7 MB). Peak memory consumption was 233.1 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,001 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.35 ms. Allocated memory is still 649.6 MB. Free memory was 563.5 MB in the beginning and 553.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.09 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 553.7 MB in the beginning and 654.2 MB in the end (delta: -100.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,003 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 ms. Allocated memory is still 687.3 MB. Free memory was 654.2 MB in the beginning and 651.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,003 INFO L168 Benchmark]: RCFGBuilder took 221.52 ms. Allocated memory is still 687.3 MB. Free memory was 651.3 MB in the beginning and 636.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,004 INFO L168 Benchmark]: BlockEncodingV2 took 90.31 ms. Allocated memory is still 687.3 MB. Free memory was 636.8 MB in the beginning and 631.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,005 INFO L168 Benchmark]: TraceAbstraction took 160.97 ms. Allocated memory is still 687.3 MB. Free memory was 631.4 MB in the beginning and 622.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,005 INFO L168 Benchmark]: BuchiAutomizer took 3662.73 ms. Allocated memory was 687.3 MB in the beginning and 757.1 MB in the end (delta: 69.7 MB). Free memory was 622.7 MB in the beginning and 437.9 MB in the end (delta: 184.8 MB). Peak memory consumption was 254.6 MB. Max. memory is 50.3 GB. 20.08/8.98 [2019-03-28 12:07:07,009 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.08/8.98 --- Results --- 20.08/8.98 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.08/8.98 - StatisticsResult: Initial Icfg 20.08/8.98 9 locations, 13 edges 20.08/8.98 - StatisticsResult: Encoded RCFG 20.08/8.98 5 locations, 11 edges 20.08/8.98 * Results from de.uni_freiburg.informatik.ultimate.core: 20.08/8.98 - StatisticsResult: Toolchain Benchmarks 20.08/8.98 Benchmark results are: 20.08/8.98 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.08/8.98 * CACSL2BoogieTranslator took 233.35 ms. Allocated memory is still 649.6 MB. Free memory was 563.5 MB in the beginning and 553.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 20.08/8.98 * Boogie Procedure Inliner took 103.09 ms. Allocated memory was 649.6 MB in the beginning and 687.3 MB in the end (delta: 37.7 MB). Free memory was 553.7 MB in the beginning and 654.2 MB in the end (delta: -100.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 20.08/8.98 * Boogie Preprocessor took 20.83 ms. Allocated memory is still 687.3 MB. Free memory was 654.2 MB in the beginning and 651.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 20.08/8.98 * RCFGBuilder took 221.52 ms. Allocated memory is still 687.3 MB. Free memory was 651.3 MB in the beginning and 636.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. 20.08/8.98 * BlockEncodingV2 took 90.31 ms. Allocated memory is still 687.3 MB. Free memory was 636.8 MB in the beginning and 631.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.08/8.98 * TraceAbstraction took 160.97 ms. Allocated memory is still 687.3 MB. Free memory was 631.4 MB in the beginning and 622.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 20.08/8.98 * BuchiAutomizer took 3662.73 ms. Allocated memory was 687.3 MB in the beginning and 757.1 MB in the end (delta: 69.7 MB). Free memory was 622.7 MB in the beginning and 437.9 MB in the end (delta: 184.8 MB). Peak memory consumption was 254.6 MB. Max. memory is 50.3 GB. 20.08/8.98 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.08/8.98 - AllSpecificationsHoldResult: All specifications hold 20.08/8.98 We were not able to verify any specifiation because the program does not contain any specification. 20.08/8.98 - InvariantResult [Line: 16]: Loop Invariant 20.08/8.98 Derived loop invariant: 1 20.08/8.98 - StatisticsResult: Ultimate Automizer benchmark data 20.08/8.98 CFG has 1 procedures, 5 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=5occurred 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 20.08/8.98 - StatisticsResult: Constructed decomposition of program 20.08/8.98 Your program was decomposed into 9 terminating modules (3 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. 20.08/8.98 - StatisticsResult: Timing statistics 20.08/8.98 BüchiAutomizer plugin needed 3.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 63 SDtfs, 122 SDslu, 100 SDs, 0 SdLazy, 258 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 20.08/8.98 - TerminationAnalysisResult: Termination proven 20.08/8.98 Buchi Automizer proved that your program is terminating 20.08/8.98 RESULT: Ultimate proved your program to be correct! 20.08/8.98 !SESSION 2019-03-28 12:06:59.201 ----------------------------------------------- 20.08/8.98 eclipse.buildId=unknown 20.08/8.98 java.version=1.8.0_181 20.08/8.98 java.vendor=Oracle Corporation 20.08/8.98 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.08/8.98 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.08/8.98 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 20.08/8.98 20.08/8.98 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:07:07.242 20.08/8.98 !MESSAGE The workspace will exit with unsaved changes in this session. 20.08/8.98 Received shutdown request... 20.08/8.98 Ultimate: 20.08/8.98 GTK+ Version Check 20.08/8.98 EOF