20.47/9.80 YES 20.47/9.80 20.47/9.80 Ultimate: Cannot open display: 20.47/9.80 This is Ultimate 0.1.24-8dc7c08-m 20.47/9.80 [2019-03-29 01:39:16,606 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.47/9.80 [2019-03-29 01:39:16,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.47/9.80 [2019-03-29 01:39:16,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.47/9.80 [2019-03-29 01:39:16,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.47/9.80 [2019-03-29 01:39:16,622 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.47/9.80 [2019-03-29 01:39:16,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.47/9.80 [2019-03-29 01:39:16,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.47/9.80 [2019-03-29 01:39:16,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.47/9.80 [2019-03-29 01:39:16,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.47/9.80 [2019-03-29 01:39:16,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.47/9.80 [2019-03-29 01:39:16,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.47/9.80 [2019-03-29 01:39:16,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.47/9.80 [2019-03-29 01:39:16,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.47/9.80 [2019-03-29 01:39:16,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.47/9.80 [2019-03-29 01:39:16,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.47/9.80 [2019-03-29 01:39:16,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.47/9.80 [2019-03-29 01:39:16,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.47/9.80 [2019-03-29 01:39:16,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.47/9.80 [2019-03-29 01:39:16,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.47/9.80 [2019-03-29 01:39:16,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.47/9.80 [2019-03-29 01:39:16,642 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.47/9.80 [2019-03-29 01:39:16,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.47/9.80 [2019-03-29 01:39:16,643 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.47/9.80 [2019-03-29 01:39:16,644 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.47/9.80 [2019-03-29 01:39:16,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.47/9.80 [2019-03-29 01:39:16,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.47/9.80 [2019-03-29 01:39:16,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.47/9.80 [2019-03-29 01:39:16,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.47/9.80 [2019-03-29 01:39:16,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.47/9.80 [2019-03-29 01:39:16,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.47/9.80 [2019-03-29 01:39:16,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.47/9.80 [2019-03-29 01:39:16,649 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 20.47/9.80 [2019-03-29 01:39:16,664 INFO L110 SettingsManager]: Loading preferences was successful 20.47/9.80 [2019-03-29 01:39:16,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.47/9.80 [2019-03-29 01:39:16,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.47/9.80 [2019-03-29 01:39:16,665 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.47/9.80 [2019-03-29 01:39:16,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.47/9.80 [2019-03-29 01:39:16,666 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.47/9.80 [2019-03-29 01:39:16,666 INFO L133 SettingsManager]: * Use SBE=true 20.47/9.80 [2019-03-29 01:39:16,666 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.47/9.80 [2019-03-29 01:39:16,666 INFO L133 SettingsManager]: * Use old map elimination=false 20.47/9.80 [2019-03-29 01:39:16,666 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.47/9.80 [2019-03-29 01:39:16,667 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.47/9.80 [2019-03-29 01:39:16,667 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.47/9.80 [2019-03-29 01:39:16,667 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.47/9.80 [2019-03-29 01:39:16,667 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.47/9.80 [2019-03-29 01:39:16,667 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:16,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.47/9.80 [2019-03-29 01:39:16,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.47/9.80 [2019-03-29 01:39:16,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.47/9.80 [2019-03-29 01:39:16,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.47/9.80 [2019-03-29 01:39:16,668 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.47/9.80 [2019-03-29 01:39:16,668 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.47/9.80 [2019-03-29 01:39:16,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.47/9.80 [2019-03-29 01:39:16,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.47/9.80 [2019-03-29 01:39:16,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.47/9.80 [2019-03-29 01:39:16,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.47/9.80 [2019-03-29 01:39:16,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.47/9.80 [2019-03-29 01:39:16,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.47/9.80 [2019-03-29 01:39:16,670 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.47/9.80 [2019-03-29 01:39:16,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.47/9.80 [2019-03-29 01:39:16,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.47/9.80 [2019-03-29 01:39:16,709 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.47/9.80 [2019-03-29 01:39:16,713 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.47/9.80 [2019-03-29 01:39:16,714 INFO L271 PluginConnector]: Initializing CDTParser... 20.47/9.80 [2019-03-29 01:39:16,715 INFO L276 PluginConnector]: CDTParser initialized 20.47/9.80 [2019-03-29 01:39:16,715 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 20.47/9.80 [2019-03-29 01:39:16,819 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/b978925188434cab93d5008af51de999/FLAGf24c0af53 20.47/9.80 [2019-03-29 01:39:17,160 INFO L307 CDTParser]: Found 1 translation units. 20.47/9.80 [2019-03-29 01:39:17,160 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 20.47/9.80 [2019-03-29 01:39:17,167 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/b978925188434cab93d5008af51de999/FLAGf24c0af53 20.47/9.80 [2019-03-29 01:39:17,558 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/b978925188434cab93d5008af51de999 20.47/9.80 [2019-03-29 01:39:17,570 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.47/9.80 [2019-03-29 01:39:17,571 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.47/9.80 [2019-03-29 01:39:17,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.47/9.80 [2019-03-29 01:39:17,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.47/9.80 [2019-03-29 01:39:17,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.47/9.80 [2019-03-29 01:39:17,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643775d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:17,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.47/9.80 [2019-03-29 01:39:17,608 INFO L176 MainTranslator]: Built tables and reachable declarations 20.47/9.80 [2019-03-29 01:39:17,768 INFO L206 PostProcessor]: Analyzing one entry point: main 20.47/9.80 [2019-03-29 01:39:17,773 INFO L191 MainTranslator]: Completed pre-run 20.47/9.80 [2019-03-29 01:39:17,790 INFO L206 PostProcessor]: Analyzing one entry point: main 20.47/9.80 [2019-03-29 01:39:17,806 INFO L195 MainTranslator]: Completed translation 20.47/9.80 [2019-03-29 01:39:17,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17 WrapperNode 20.47/9.80 [2019-03-29 01:39:17,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.47/9.80 [2019-03-29 01:39:17,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.47/9.80 [2019-03-29 01:39:17,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.47/9.80 [2019-03-29 01:39:17,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.47/9.80 [2019-03-29 01:39:17,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.47/9.80 [2019-03-29 01:39:17,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.47/9.80 [2019-03-29 01:39:17,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.47/9.80 [2019-03-29 01:39:17,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.47/9.80 [2019-03-29 01:39:17,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 [2019-03-29 01:39:17,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.47/9.80 [2019-03-29 01:39:17,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.47/9.80 [2019-03-29 01:39:17,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.47/9.80 [2019-03-29 01:39:17,925 INFO L276 PluginConnector]: RCFGBuilder initialized 20.47/9.80 [2019-03-29 01:39:17,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (1/1) ... 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.47/9.80 [2019-03-29 01:39:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.47/9.80 [2019-03-29 01:39:17,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.47/9.80 [2019-03-29 01:39:18,119 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.47/9.80 [2019-03-29 01:39:18,119 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 20.47/9.80 [2019-03-29 01:39:18,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:39:18 BoogieIcfgContainer 20.47/9.80 [2019-03-29 01:39:18,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.47/9.80 [2019-03-29 01:39:18,121 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.47/9.80 [2019-03-29 01:39:18,121 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.47/9.80 [2019-03-29 01:39:18,123 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.47/9.80 [2019-03-29 01:39:18,124 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:39:18" (1/1) ... 20.47/9.80 [2019-03-29 01:39:18,139 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges 20.47/9.80 [2019-03-29 01:39:18,140 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.47/9.80 [2019-03-29 01:39:18,141 INFO L263 BlockEncoder]: Using Maximize final states 20.47/9.80 [2019-03-29 01:39:18,142 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.47/9.80 [2019-03-29 01:39:18,142 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.47/9.80 [2019-03-29 01:39:18,144 INFO L296 BlockEncoder]: Using Remove sink states 20.47/9.80 [2019-03-29 01:39:18,145 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.47/9.80 [2019-03-29 01:39:18,145 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.47/9.80 [2019-03-29 01:39:18,161 INFO L185 BlockEncoder]: Using Use SBE 20.47/9.80 [2019-03-29 01:39:18,178 INFO L200 BlockEncoder]: SBE split 4 edges 20.47/9.80 [2019-03-29 01:39:18,183 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 20.47/9.80 [2019-03-29 01:39:18,185 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.47/9.80 [2019-03-29 01:39:18,196 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.47/9.80 [2019-03-29 01:39:18,198 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 20.47/9.80 [2019-03-29 01:39:18,199 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.47/9.80 [2019-03-29 01:39:18,199 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.47/9.80 [2019-03-29 01:39:18,199 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.47/9.80 [2019-03-29 01:39:18,200 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.47/9.80 [2019-03-29 01:39:18,200 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 11 edges 20.47/9.80 [2019-03-29 01:39:18,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:39:18 BasicIcfg 20.47/9.80 [2019-03-29 01:39:18,201 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.47/9.80 [2019-03-29 01:39:18,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.47/9.80 [2019-03-29 01:39:18,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.47/9.80 [2019-03-29 01:39:18,205 INFO L276 PluginConnector]: TraceAbstraction initialized 20.47/9.80 [2019-03-29 01:39:18,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:39:17" (1/4) ... 20.47/9.80 [2019-03-29 01:39:18,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a16c613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (2/4) ... 20.47/9.80 [2019-03-29 01:39:18,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a16c613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:39:18" (3/4) ... 20.47/9.80 [2019-03-29 01:39:18,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a16c613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:39:18" (4/4) ... 20.47/9.80 [2019-03-29 01:39:18,211 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.47/9.80 [2019-03-29 01:39:18,222 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.47/9.80 [2019-03-29 01:39:18,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.47/9.80 [2019-03-29 01:39:18,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.47/9.80 [2019-03-29 01:39:18,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.47/9.80 [2019-03-29 01:39:18,280 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.47/9.80 [2019-03-29 01:39:18,280 INFO L383 AbstractCegarLoop]: Hoare is true 20.47/9.80 [2019-03-29 01:39:18,280 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.47/9.80 [2019-03-29 01:39:18,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.47/9.80 [2019-03-29 01:39:18,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.47/9.80 [2019-03-29 01:39:18,280 INFO L387 AbstractCegarLoop]: Difference is false 20.47/9.80 [2019-03-29 01:39:18,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.47/9.80 [2019-03-29 01:39:18,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.47/9.80 [2019-03-29 01:39:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 20.47/9.80 [2019-03-29 01:39:18,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.47/9.80 [2019-03-29 01:39:18,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 20.47/9.80 [2019-03-29 01:39:18,361 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. 20.47/9.80 [2019-03-29 01:39:18,362 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 22) no Hoare annotation was computed. 20.47/9.80 [2019-03-29 01:39:18,362 INFO L451 ceAbstractionStarter]: At program point L18-2(lines 18 26) the Hoare annotation is: true 20.47/9.80 [2019-03-29 01:39:18,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.47/9.80 [2019-03-29 01:39:18,363 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. 20.47/9.80 [2019-03-29 01:39:18,363 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 22) the Hoare annotation is: true 20.47/9.80 [2019-03-29 01:39:18,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:39:18 BasicIcfg 20.47/9.80 [2019-03-29 01:39:18,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.47/9.80 [2019-03-29 01:39:18,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.47/9.80 [2019-03-29 01:39:18,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.47/9.80 [2019-03-29 01:39:18,375 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.47/9.80 [2019-03-29 01:39:18,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.47/9.80 [2019-03-29 01:39:18,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:39:17" (1/5) ... 20.47/9.80 [2019-03-29 01:39:18,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,377 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.47/9.80 [2019-03-29 01:39:18,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:39:17" (2/5) ... 20.47/9.80 [2019-03-29 01:39:18,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.47/9.80 [2019-03-29 01:39:18,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:39:18" (3/5) ... 20.47/9.80 [2019-03-29 01:39:18,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.47/9.80 [2019-03-29 01:39:18,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:39:18" (4/5) ... 20.47/9.80 [2019-03-29 01:39:18,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e47dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:39:18, skipping insertion in model container 20.47/9.80 [2019-03-29 01:39:18,380 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.47/9.80 [2019-03-29 01:39:18,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:39:18" (5/5) ... 20.47/9.80 [2019-03-29 01:39:18,381 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.47/9.80 [2019-03-29 01:39:18,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.47/9.80 [2019-03-29 01:39:18,408 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.47/9.80 [2019-03-29 01:39:18,408 INFO L375 BuchiCegarLoop]: Hoare is true 20.47/9.80 [2019-03-29 01:39:18,408 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.47/9.80 [2019-03-29 01:39:18,408 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.47/9.80 [2019-03-29 01:39:18,408 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.47/9.80 [2019-03-29 01:39:18,408 INFO L379 BuchiCegarLoop]: Difference is false 20.47/9.80 [2019-03-29 01:39:18,409 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.47/9.80 [2019-03-29 01:39:18,409 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.47/9.80 [2019-03-29 01:39:18,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 20.47/9.80 [2019-03-29 01:39:18,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.47/9.80 [2019-03-29 01:39:18,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.80 [2019-03-29 01:39:18,431 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.80 [2019-03-29 01:39:18,436 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.47/9.80 [2019-03-29 01:39:18,436 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.47/9.80 [2019-03-29 01:39:18,436 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.47/9.80 [2019-03-29 01:39:18,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 20.47/9.80 [2019-03-29 01:39:18,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.47/9.80 [2019-03-29 01:39:18,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.80 [2019-03-29 01:39:18,437 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.80 [2019-03-29 01:39:18,438 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.47/9.80 [2019-03-29 01:39:18,438 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.47/9.80 [2019-03-29 01:39:18,443 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 4#L18-2true 20.47/9.80 [2019-03-29 01:39:18,444 INFO L796 eck$LassoCheckResult]: Loop: 4#L18-2true [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 8#L19true [50] L19-->L19-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 5#L19-2true [44] L19-2-->L18-2: Formula: (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 4#L18-2true 20.47/9.80 [2019-03-29 01:39:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times 20.47/9.80 [2019-03-29 01:39:18,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.80 [2019-03-29 01:39:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.80 [2019-03-29 01:39:18,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash 71747, now seen corresponding path program 1 times 20.47/9.80 [2019-03-29 01:39:18,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.80 [2019-03-29 01:39:18,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.80 [2019-03-29 01:39:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2127326, now seen corresponding path program 1 times 20.47/9.80 [2019-03-29 01:39:18,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.80 [2019-03-29 01:39:18,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.80 [2019-03-29 01:39:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:18,601 INFO L216 LassoAnalysis]: Preferences: 20.47/9.80 [2019-03-29 01:39:18,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.80 [2019-03-29 01:39:18,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.80 [2019-03-29 01:39:18,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.80 [2019-03-29 01:39:18,602 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.80 [2019-03-29 01:39:18,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.80 [2019-03-29 01:39:18,603 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.80 [2019-03-29 01:39:18,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.47/9.80 [2019-03-29 01:39:18,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.80 [2019-03-29 01:39:18,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.80 [2019-03-29 01:39:18,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,733 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.80 [2019-03-29 01:39:18,734 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,740 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 [2019-03-29 01:39:18,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.80 [2019-03-29 01:39:18,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,779 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 [2019-03-29 01:39:18,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.80 [2019-03-29 01:39:18,806 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,811 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 [2019-03-29 01:39:18,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.80 [2019-03-29 01:39:18,839 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.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,847 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 [2019-03-29 01:39:18,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.80 [2019-03-29 01:39:18,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,883 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.80 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.80 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.80 [2019-03-29 01:39:18,915 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.80 [2019-03-29 01:39:18,947 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.80 [2019-03-29 01:39:18,951 INFO L216 LassoAnalysis]: Preferences: 20.47/9.80 [2019-03-29 01:39:18,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.80 [2019-03-29 01:39:18,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.80 [2019-03-29 01:39:18,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.80 [2019-03-29 01:39:18,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.80 [2019-03-29 01:39:18,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.80 [2019-03-29 01:39:18,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.80 [2019-03-29 01:39:18,952 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.80 [2019-03-29 01:39:18,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.47/9.80 [2019-03-29 01:39:18,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.80 [2019-03-29 01:39:18,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.80 [2019-03-29 01:39:18,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.80 [2019-03-29 01:39:19,055 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.80 [2019-03-29 01:39:19,061 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.80 [2019-03-29 01:39:19,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.80 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.80 Number of strict supporting invariants: 0 20.47/9.80 Number of non-strict supporting invariants: 1 20.47/9.80 Consider only non-deceasing supporting invariants: true 20.47/9.80 Simplify termination arguments: true 20.47/9.80 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.80 [2019-03-29 01:39:19,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.80 [2019-03-29 01:39:19,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.80 [2019-03-29 01:39:19,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.80 [2019-03-29 01:39:19,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.80 [2019-03-29 01:39:19,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.80 [2019-03-29 01:39:19,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.80 [2019-03-29 01:39:19,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.80 [2019-03-29 01:39:19,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.80 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.80 Number of strict supporting invariants: 0 20.47/9.80 Number of non-strict supporting invariants: 1 20.47/9.80 Consider only non-deceasing supporting invariants: true 20.47/9.80 Simplify termination arguments: true 20.47/9.80 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.80 [2019-03-29 01:39:19,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.80 [2019-03-29 01:39:19,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.80 [2019-03-29 01:39:19,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.80 [2019-03-29 01:39:19,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.80 [2019-03-29 01:39:19,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.80 [2019-03-29 01:39:19,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.80 [2019-03-29 01:39:19,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.80 [2019-03-29 01:39:19,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.80 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.80 Number of strict supporting invariants: 0 20.47/9.80 Number of non-strict supporting invariants: 1 20.47/9.80 Consider only non-deceasing supporting invariants: true 20.47/9.80 Simplify termination arguments: true 20.47/9.80 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.80 [2019-03-29 01:39:19,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.80 [2019-03-29 01:39:19,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.80 [2019-03-29 01:39:19,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.80 [2019-03-29 01:39:19,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.80 [2019-03-29 01:39:19,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.80 [2019-03-29 01:39:19,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.80 [2019-03-29 01:39:19,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.80 [2019-03-29 01:39:19,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.80 [2019-03-29 01:39:19,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.80 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.80 Number of strict supporting invariants: 0 20.47/9.80 Number of non-strict supporting invariants: 1 20.47/9.80 Consider only non-deceasing supporting invariants: true 20.47/9.80 Simplify termination arguments: true 20.47/9.80 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.80 [2019-03-29 01:39:19,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.80 [2019-03-29 01:39:19,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.80 [2019-03-29 01:39:19,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.80 [2019-03-29 01:39:19,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.80 [2019-03-29 01:39:19,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.80 [2019-03-29 01:39:19,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.80 [2019-03-29 01:39:19,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.80 [2019-03-29 01:39:19,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.80 [2019-03-29 01:39:19,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.80 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.80 Number of strict supporting invariants: 0 20.47/9.80 Number of non-strict supporting invariants: 1 20.47/9.80 Consider only non-deceasing supporting invariants: true 20.47/9.80 Simplify termination arguments: true 20.47/9.80 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.80 [2019-03-29 01:39:19,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.80 [2019-03-29 01:39:19,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.80 [2019-03-29 01:39:19,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.80 [2019-03-29 01:39:19,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.80 [2019-03-29 01:39:19,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.80 [2019-03-29 01:39:19,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.80 [2019-03-29 01:39:19,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.80 [2019-03-29 01:39:19,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.80 [2019-03-29 01:39:19,129 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.80 [2019-03-29 01:39:19,129 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 20.47/9.80 [2019-03-29 01:39:19,131 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.80 [2019-03-29 01:39:19,132 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.80 [2019-03-29 01:39:19,132 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.80 [2019-03-29 01:39:19,132 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.80 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.47/9.80 Supporting invariants [] 20.47/9.80 [2019-03-29 01:39:19,134 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.80 [2019-03-29 01:39:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.80 [2019-03-29 01:39:19,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.80 [2019-03-29 01:39:19,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.80 [2019-03-29 01:39:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.80 [2019-03-29 01:39:19,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.80 [2019-03-29 01:39:19,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.80 [2019-03-29 01:39:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.80 [2019-03-29 01:39:19,238 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 20.47/9.80 [2019-03-29 01:39:19,243 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 20.47/9.80 [2019-03-29 01:39:19,245 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. 20.47/9.80 [2019-03-29 01:39:19,323 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 43 transitions. Complement of second has 7 states. 20.47/9.80 [2019-03-29 01:39:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 20.47/9.80 [2019-03-29 01:39:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.47/9.80 [2019-03-29 01:39:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. 20.47/9.80 [2019-03-29 01:39:19,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. 20.47/9.80 [2019-03-29 01:39:19,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.80 [2019-03-29 01:39:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. 20.47/9.80 [2019-03-29 01:39:19,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.80 [2019-03-29 01:39:19,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. 20.47/9.80 [2019-03-29 01:39:19,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.80 [2019-03-29 01:39:19,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 43 transitions. 20.47/9.80 [2019-03-29 01:39:19,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.47/9.80 [2019-03-29 01:39:19,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 32 transitions. 20.47/9.80 [2019-03-29 01:39:19,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.47/9.80 [2019-03-29 01:39:19,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 20.47/9.80 [2019-03-29 01:39:19,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 32 transitions. 20.47/9.80 [2019-03-29 01:39:19,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.80 [2019-03-29 01:39:19,347 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 32 transitions. 20.47/9.80 [2019-03-29 01:39:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 32 transitions. 20.47/9.80 [2019-03-29 01:39:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 20.47/9.80 [2019-03-29 01:39:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 20.47/9.80 [2019-03-29 01:39:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. 20.47/9.80 [2019-03-29 01:39:19,378 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. 20.47/9.80 [2019-03-29 01:39:19,378 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. 20.47/9.80 [2019-03-29 01:39:19,378 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.47/9.80 [2019-03-29 01:39:19,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 26 transitions. 20.47/9.80 [2019-03-29 01:39:19,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.47/9.80 [2019-03-29 01:39:19,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.80 [2019-03-29 01:39:19,379 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.80 [2019-03-29 01:39:19,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.47/9.80 [2019-03-29 01:39:19,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.47/9.80 [2019-03-29 01:39:19,381 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 73#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 78#L19 [59] L19-->L20-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 83#L20-2 [63] L20-2-->L20-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 84#L20-2 20.47/9.80 [2019-03-29 01:39:19,381 INFO L796 eck$LassoCheckResult]: Loop: 84#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 84#L20-2 20.47/9.80 [2019-03-29 01:39:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:19,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 1 times 20.47/9.80 [2019-03-29 01:39:19,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.80 [2019-03-29 01:39:19,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.80 [2019-03-29 01:39:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:19,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times 20.47/9.80 [2019-03-29 01:39:19,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.80 [2019-03-29 01:39:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.80 [2019-03-29 01:39:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.80 [2019-03-29 01:39:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.80 [2019-03-29 01:39:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.80 [2019-03-29 01:39:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 65956406, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:19,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:19,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:19,431 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:19,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:19,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:19,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:19,432 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.81 [2019-03-29 01:39:19,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:19,432 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:19,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.47/9.81 [2019-03-29 01:39:19,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:19,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:19,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,500 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:19,501 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:19,511 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:19,547 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:19,548 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:19,554 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:19,581 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:19,581 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:19,590 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:19,618 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:19,619 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-1} Honda state: {ULTIMATE.start_main_#t~nondet2=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:19,624 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:19,671 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:19,871 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.81 [2019-03-29 01:39:19,874 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:19,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:19,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:19,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:19,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.81 [2019-03-29 01:39:19,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:19,875 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:19,875 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:19,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.47/9.81 [2019-03-29 01:39:19,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:19,876 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:19,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:19,934 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:19,934 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.81 [2019-03-29 01:39:19,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:19,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:19,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:19,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:19,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:19,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:19,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:19,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:19,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:19,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:19,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:19,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:19,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:19,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:19,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:19,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:19,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:19,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:19,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:19,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:19,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:19,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:19,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:19,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:19,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:19,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:19,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:19,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:19,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:19,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:19,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:19,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:19,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:19,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.81 [2019-03-29 01:39:19,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.81 [2019-03-29 01:39:19,968 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.47/9.81 [2019-03-29 01:39:19,969 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.81 [2019-03-29 01:39:19,969 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.81 [2019-03-29 01:39:19,969 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.81 [2019-03-29 01:39:19,969 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.81 Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 20.47/9.81 Supporting invariants [] 20.47/9.81 [2019-03-29 01:39:19,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.81 [2019-03-29 01:39:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:19,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:19,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:20,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:20,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:20,004 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 20.47/9.81 [2019-03-29 01:39:20,004 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 20.47/9.81 [2019-03-29 01:39:20,004 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14 Second operand 2 states. 20.47/9.81 [2019-03-29 01:39:20,035 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14. Second operand 2 states. Result 20 states and 41 transitions. Complement of second has 4 states. 20.47/9.81 [2019-03-29 01:39:20,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 20.47/9.81 [2019-03-29 01:39:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 20.47/9.81 [2019-03-29 01:39:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. 20.47/9.81 [2019-03-29 01:39:20,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 41 transitions. 20.47/9.81 [2019-03-29 01:39:20,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 20.47/9.81 [2019-03-29 01:39:20,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 36 transitions. 20.47/9.81 [2019-03-29 01:39:20,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.47/9.81 [2019-03-29 01:39:20,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 20.47/9.81 [2019-03-29 01:39:20,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 36 transitions. 20.47/9.81 [2019-03-29 01:39:20,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.81 [2019-03-29 01:39:20,043 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. 20.47/9.81 [2019-03-29 01:39:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 36 transitions. 20.47/9.81 [2019-03-29 01:39:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. 20.47/9.81 [2019-03-29 01:39:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 20.47/9.81 [2019-03-29 01:39:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,046 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,046 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,047 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.47/9.81 [2019-03-29 01:39:20,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.47/9.81 [2019-03-29 01:39:20,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.81 [2019-03-29 01:39:20,048 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.81 [2019-03-29 01:39:20,048 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:20,048 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 20.47/9.81 [2019-03-29 01:39:20,049 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 146#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 144#L19 [59] L19-->L20-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 151#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 152#L20-2 20.47/9.81 [2019-03-29 01:39:20,049 INFO L796 eck$LassoCheckResult]: Loop: 152#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 152#L20-2 20.47/9.81 [2019-03-29 01:39:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:20,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 2 times 20.47/9.81 [2019-03-29 01:39:20,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 65956375, now seen corresponding path program 2 times 20.47/9.81 [2019-03-29 01:39:20,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,098 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:20,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:20,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:20,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:20,098 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.81 [2019-03-29 01:39:20,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:20,099 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:20,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.47/9.81 [2019-03-29 01:39:20,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:20,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:20,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,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.47/9.81 [2019-03-29 01:39:20,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,170 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:20,170 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,174 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:20,202 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:20,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,207 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,239 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:20,433 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.81 [2019-03-29 01:39:20,435 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:20,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:20,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:20,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:20,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.81 [2019-03-29 01:39:20,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:20,436 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:20,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.47/9.81 [2019-03-29 01:39:20,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:20,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:20,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,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.47/9.81 [2019-03-29 01:39:20,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,496 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:20,497 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.81 [2019-03-29 01:39:20,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:20,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:20,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:20,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:20,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:20,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:20,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:20,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:20,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.81 [2019-03-29 01:39:20,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.81 [2019-03-29 01:39:20,506 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.47/9.81 [2019-03-29 01:39:20,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.81 [2019-03-29 01:39:20,507 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.81 [2019-03-29 01:39:20,507 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.81 [2019-03-29 01:39:20,508 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.81 Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 20.47/9.81 Supporting invariants [] 20.47/9.81 [2019-03-29 01:39:20,508 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.81 [2019-03-29 01:39:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:20,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:20,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:20,538 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:20,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:20,539 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 20.47/9.81 [2019-03-29 01:39:20,539 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 20.47/9.81 [2019-03-29 01:39:20,540 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 2 states. 20.47/9.81 [2019-03-29 01:39:20,565 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 2 states. Result 27 states and 69 transitions. Complement of second has 4 states. 20.47/9.81 [2019-03-29 01:39:20,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 20.47/9.81 [2019-03-29 01:39:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 20.47/9.81 [2019-03-29 01:39:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. 20.47/9.81 [2019-03-29 01:39:20,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. 20.47/9.81 [2019-03-29 01:39:20,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. 20.47/9.81 [2019-03-29 01:39:20,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. 20.47/9.81 [2019-03-29 01:39:20,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:20,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 69 transitions. 20.47/9.81 [2019-03-29 01:39:20,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 20.47/9.81 [2019-03-29 01:39:20,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 57 transitions. 20.47/9.81 [2019-03-29 01:39:20,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.47/9.81 [2019-03-29 01:39:20,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 20.47/9.81 [2019-03-29 01:39:20,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 57 transitions. 20.47/9.81 [2019-03-29 01:39:20,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.81 [2019-03-29 01:39:20,573 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 57 transitions. 20.47/9.81 [2019-03-29 01:39:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 57 transitions. 20.47/9.81 [2019-03-29 01:39:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. 20.47/9.81 [2019-03-29 01:39:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 20.47/9.81 [2019-03-29 01:39:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,576 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,576 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,576 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.47/9.81 [2019-03-29 01:39:20,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. 20.47/9.81 [2019-03-29 01:39:20,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.47/9.81 [2019-03-29 01:39:20,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.81 [2019-03-29 01:39:20,577 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.81 [2019-03-29 01:39:20,577 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:20,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:20,578 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 223#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 220#L19 [59] L19-->L20-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 228#L20-2 [63] L20-2-->L20-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 229#L20-2 20.47/9.81 [2019-03-29 01:39:20,578 INFO L796 eck$LassoCheckResult]: Loop: 229#L20-2 [60] L20-2-->L20-3: Formula: (> v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_6) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 224#L20-3 [45] L20-3-->L19-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 225#L19-2 [44] L19-2-->L18-2: Formula: (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 217#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 218#L19 [58] L19-->L20-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 232#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 229#L20-2 20.47/9.81 [2019-03-29 01:39:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 2 times 20.47/9.81 [2019-03-29 01:39:20,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1646803084, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:20,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2110692667, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:20,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:20,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:20,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.47/9.81 [2019-03-29 01:39:20,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.47/9.81 [2019-03-29 01:39:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:20,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:20,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:20,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.47/9.81 [2019-03-29 01:39:20,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 20.47/9.81 [2019-03-29 01:39:20,834 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:20,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:20,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:20,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:20,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.81 [2019-03-29 01:39:20,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:20,835 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:20,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.47/9.81 [2019-03-29 01:39:20,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:20,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:20,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:20,918 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:20,918 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,926 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:20,934 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:20,934 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,961 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:20,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:20,991 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,050 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.81 [2019-03-29 01:39:21,053 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:21,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:21,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:21,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:21,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.81 [2019-03-29 01:39:21,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:21,054 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:21,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.47/9.81 [2019-03-29 01:39:21,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:21,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:21,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,132 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:21,132 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.81 [2019-03-29 01:39:21,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,140 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.81 [2019-03-29 01:39:21,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.81 [2019-03-29 01:39:21,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.47/9.81 [2019-03-29 01:39:21,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.81 [2019-03-29 01:39:21,143 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.81 [2019-03-29 01:39:21,144 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.81 [2019-03-29 01:39:21,144 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.81 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.47/9.81 Supporting invariants [] 20.47/9.81 [2019-03-29 01:39:21,144 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.81 [2019-03-29 01:39:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:21,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:21,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:21,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:21,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:21,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:21,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:21,236 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.47/9.81 [2019-03-29 01:39:21,236 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.47/9.81 [2019-03-29 01:39:21,236 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 5 states. 20.47/9.81 [2019-03-29 01:39:21,313 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 86 states and 241 transitions. Complement of second has 31 states. 20.47/9.81 [2019-03-29 01:39:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 20.47/9.81 [2019-03-29 01:39:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.47/9.81 [2019-03-29 01:39:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. 20.47/9.81 [2019-03-29 01:39:21,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. 20.47/9.81 [2019-03-29 01:39:21,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:21,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. 20.47/9.81 [2019-03-29 01:39:21,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:21,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. 20.47/9.81 [2019-03-29 01:39:21,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:21,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 241 transitions. 20.47/9.81 [2019-03-29 01:39:21,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 20.47/9.81 [2019-03-29 01:39:21,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 51 states and 117 transitions. 20.47/9.81 [2019-03-29 01:39:21,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 20.47/9.81 [2019-03-29 01:39:21,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 20.47/9.81 [2019-03-29 01:39:21,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 117 transitions. 20.47/9.81 [2019-03-29 01:39:21,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.81 [2019-03-29 01:39:21,326 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 117 transitions. 20.47/9.81 [2019-03-29 01:39:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 117 transitions. 20.47/9.81 [2019-03-29 01:39:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. 20.47/9.81 [2019-03-29 01:39:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 20.47/9.81 [2019-03-29 01:39:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 69 transitions. 20.47/9.81 [2019-03-29 01:39:21,330 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 69 transitions. 20.47/9.81 [2019-03-29 01:39:21,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 20.47/9.81 [2019-03-29 01:39:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 20.47/9.81 [2019-03-29 01:39:21,334 INFO L87 Difference]: Start difference. First operand 33 states and 69 transitions. Second operand 9 states. 20.47/9.81 [2019-03-29 01:39:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.47/9.81 [2019-03-29 01:39:21,481 INFO L93 Difference]: Finished difference Result 89 states and 158 transitions. 20.47/9.81 [2019-03-29 01:39:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 20.47/9.81 [2019-03-29 01:39:21,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 158 transitions. 20.47/9.81 [2019-03-29 01:39:21,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 20.47/9.81 [2019-03-29 01:39:21,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 69 states and 132 transitions. 20.47/9.81 [2019-03-29 01:39:21,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 20.47/9.81 [2019-03-29 01:39:21,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 20.47/9.81 [2019-03-29 01:39:21,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 132 transitions. 20.47/9.81 [2019-03-29 01:39:21,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.81 [2019-03-29 01:39:21,488 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 132 transitions. 20.47/9.81 [2019-03-29 01:39:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 132 transitions. 20.47/9.81 [2019-03-29 01:39:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. 20.47/9.81 [2019-03-29 01:39:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 20.47/9.81 [2019-03-29 01:39:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. 20.47/9.81 [2019-03-29 01:39:21,493 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. 20.47/9.81 [2019-03-29 01:39:21,493 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. 20.47/9.81 [2019-03-29 01:39:21,493 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.47/9.81 [2019-03-29 01:39:21,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 104 transitions. 20.47/9.81 [2019-03-29 01:39:21,495 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 20.47/9.81 [2019-03-29 01:39:21,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.81 [2019-03-29 01:39:21,495 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.81 [2019-03-29 01:39:21,495 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:21,495 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:21,496 INFO L794 eck$LassoCheckResult]: Stem: 604#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 605#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 636#L19 [59] L19-->L20-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 635#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 626#L20-2 20.47/9.81 [2019-03-29 01:39:21,496 INFO L796 eck$LassoCheckResult]: Loop: 626#L20-2 [61] L20-2-->L20-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 625#L20-3 [45] L20-3-->L19-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 633#L19-2 [44] L19-2-->L18-2: Formula: (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 634#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 632#L19 [58] L19-->L20-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 624#L20-2 [62] L20-2-->L20-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 626#L20-2 20.47/9.81 [2019-03-29 01:39:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 3 times 20.47/9.81 [2019-03-29 01:39:21,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:21,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1618173933, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:21,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:21,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1251818137, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:21,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:21,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:21,557 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:21,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:21,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:21,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:21,557 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.81 [2019-03-29 01:39:21,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:21,558 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:21,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.47/9.81 [2019-03-29 01:39:21,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:21,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:21,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,633 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:21,633 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,636 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:21,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=1} Honda state: {ULTIMATE.start_main_#t~nondet1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,667 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:21,694 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,699 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,727 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:21,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,731 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:21,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,763 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:21,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,792 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:21,821 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:21,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.81 [2019-03-29 01:39:21,878 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:21,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:21,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:21,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:21,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.81 [2019-03-29 01:39:21,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:21,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:21,879 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:21,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.47/9.81 [2019-03-29 01:39:21,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:21,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:21,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:21,948 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:21,948 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.81 [2019-03-29 01:39:21,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:21,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:21,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:21,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:21,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:21,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:21,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:21,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:21,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:21,974 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.81 [2019-03-29 01:39:21,975 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.81 [2019-03-29 01:39:21,975 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.47/9.81 [2019-03-29 01:39:21,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.81 [2019-03-29 01:39:21,976 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.81 [2019-03-29 01:39:21,976 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.81 [2019-03-29 01:39:21,976 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.81 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.47/9.81 Supporting invariants [] 20.47/9.81 [2019-03-29 01:39:21,977 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.81 [2019-03-29 01:39:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:21,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:21,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,058 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.47/9.81 [2019-03-29 01:39:22,058 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.47/9.81 [2019-03-29 01:39:22,059 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61 Second operand 5 states. 20.47/9.81 [2019-03-29 01:39:22,143 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61. Second operand 5 states. Result 354 states and 811 transitions. Complement of second has 31 states. 20.47/9.81 [2019-03-29 01:39:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 20.47/9.81 [2019-03-29 01:39:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.47/9.81 [2019-03-29 01:39:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. 20.47/9.81 [2019-03-29 01:39:22,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. 20.47/9.81 [2019-03-29 01:39:22,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. 20.47/9.81 [2019-03-29 01:39:22,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. 20.47/9.81 [2019-03-29 01:39:22,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 811 transitions. 20.47/9.81 [2019-03-29 01:39:22,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 20.47/9.81 [2019-03-29 01:39:22,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 201 states and 397 transitions. 20.47/9.81 [2019-03-29 01:39:22,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 20.47/9.81 [2019-03-29 01:39:22,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 20.47/9.81 [2019-03-29 01:39:22,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 397 transitions. 20.47/9.81 [2019-03-29 01:39:22,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.47/9.81 [2019-03-29 01:39:22,160 INFO L706 BuchiCegarLoop]: Abstraction has 201 states and 397 transitions. 20.47/9.81 [2019-03-29 01:39:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 397 transitions. 20.47/9.81 [2019-03-29 01:39:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 35. 20.47/9.81 [2019-03-29 01:39:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 20.47/9.81 [2019-03-29 01:39:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. 20.47/9.81 [2019-03-29 01:39:22,167 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. 20.47/9.81 [2019-03-29 01:39:22,167 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. 20.47/9.81 [2019-03-29 01:39:22,167 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.47/9.81 [2019-03-29 01:39:22,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 65 transitions. 20.47/9.81 [2019-03-29 01:39:22,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.47/9.81 [2019-03-29 01:39:22,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.47/9.81 [2019-03-29 01:39:22,168 INFO L119 BuchiIsEmpty]: Starting construction of run 20.47/9.81 [2019-03-29 01:39:22,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 20.47/9.81 [2019-03-29 01:39:22,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.47/9.81 [2019-03-29 01:39:22,169 INFO L794 eck$LassoCheckResult]: Stem: 1124#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1125#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1136#L19 [59] L19-->L20-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1137#L20-2 [63] L20-2-->L20-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~m~0_7) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 1130#L20-2 [61] L20-2-->L20-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1131#L20-3 [45] L20-3-->L19-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 1152#L19-2 [44] L19-2-->L18-2: Formula: (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1151#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1150#L19 [50] L19-->L19-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L19-2 20.47/9.81 [2019-03-29 01:39:22,170 INFO L796 eck$LassoCheckResult]: Loop: 1126#L19-2 [44] L19-2-->L18-2: Formula: (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 1120#L18-2 [42] L18-2-->L19: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 1121#L19 [50] L19-->L19-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L19-2 20.47/9.81 [2019-03-29 01:39:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 900294364, now seen corresponding path program 1 times 20.47/9.81 [2019-03-29 01:39:22,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash 73427, now seen corresponding path program 2 times 20.47/9.81 [2019-03-29 01:39:22,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:22,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.47/9.81 [2019-03-29 01:39:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1401321960, now seen corresponding path program 2 times 20.47/9.81 [2019-03-29 01:39:22,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.47/9.81 [2019-03-29 01:39:22,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.47/9.81 [2019-03-29 01:39:22,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.47/9.81 [2019-03-29 01:39:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:22,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.47/9.81 [2019-03-29 01:39:22,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.47/9.81 [2019-03-29 01:39:22,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 20.47/9.81 [2019-03-29 01:39:22,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 20.47/9.81 [2019-03-29 01:39:22,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.47/9.81 [2019-03-29 01:39:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 20.47/9.81 [2019-03-29 01:39:22,278 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:22,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:22,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:22,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:22,279 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.47/9.81 [2019-03-29 01:39:22,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:22,279 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:22,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.47/9.81 [2019-03-29 01:39:22,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:22,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:22,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,344 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:22,344 INFO L412 LassoAnalysis]: Checking for nontermination... 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,348 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:22,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:22,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,379 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:22,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:22,408 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,412 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:22,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:22,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,443 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:22,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.47/9.81 [2019-03-29 01:39:22,470 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.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,474 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.47/9.81 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.47/9.81 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.47/9.81 [2019-03-29 01:39:22,505 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.47/9.81 [2019-03-29 01:39:22,561 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.47/9.81 [2019-03-29 01:39:22,563 INFO L216 LassoAnalysis]: Preferences: 20.47/9.81 [2019-03-29 01:39:22,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.47/9.81 [2019-03-29 01:39:22,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.47/9.81 [2019-03-29 01:39:22,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.47/9.81 [2019-03-29 01:39:22,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.47/9.81 [2019-03-29 01:39:22,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.47/9.81 [2019-03-29 01:39:22,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.47/9.81 [2019-03-29 01:39:22,564 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.47/9.81 [2019-03-29 01:39:22,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.47/9.81 [2019-03-29 01:39:22,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.47/9.81 [2019-03-29 01:39:22,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.47/9.81 [2019-03-29 01:39:22,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.47/9.81 [2019-03-29 01:39:22,614 INFO L300 LassoAnalysis]: Preprocessing complete. 20.47/9.81 [2019-03-29 01:39:22,615 INFO L497 LassoAnalysis]: Using template 'affine'. 20.47/9.81 [2019-03-29 01:39:22,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:22,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:22,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:22,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:22,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:22,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:22,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:22,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:22,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:22,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:22,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:22,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:22,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:22,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:22,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:22,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:22,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:22,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:22,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:22,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:22,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:22,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:22,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:22,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:22,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:22,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.47/9.81 [2019-03-29 01:39:22,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.47/9.81 Termination analysis: LINEAR_WITH_GUESSES 20.47/9.81 Number of strict supporting invariants: 0 20.47/9.81 Number of non-strict supporting invariants: 1 20.47/9.81 Consider only non-deceasing supporting invariants: true 20.47/9.81 Simplify termination arguments: true 20.47/9.81 Simplify supporting invariants: trueOverapproximate stem: false 20.47/9.81 [2019-03-29 01:39:22,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.47/9.81 [2019-03-29 01:39:22,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.47/9.81 [2019-03-29 01:39:22,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.47/9.81 [2019-03-29 01:39:22,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.47/9.81 [2019-03-29 01:39:22,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.47/9.81 [2019-03-29 01:39:22,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.47/9.81 [2019-03-29 01:39:22,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.47/9.81 [2019-03-29 01:39:22,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.47/9.81 [2019-03-29 01:39:22,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.47/9.81 [2019-03-29 01:39:22,631 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.47/9.81 [2019-03-29 01:39:22,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.47/9.81 [2019-03-29 01:39:22,632 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.47/9.81 [2019-03-29 01:39:22,632 INFO L518 LassoAnalysis]: Proved termination. 20.47/9.81 [2019-03-29 01:39:22,632 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.47/9.81 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 20.47/9.81 Supporting invariants [] 20.47/9.81 [2019-03-29 01:39:22,632 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.47/9.81 [2019-03-29 01:39:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.47/9.81 [2019-03-29 01:39:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.47/9.81 [2019-03-29 01:39:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.47/9.81 [2019-03-29 01:39:22,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 20.47/9.81 [2019-03-29 01:39:22,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.47/9.81 [2019-03-29 01:39:22,682 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.47/9.81 [2019-03-29 01:39:22,682 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.47/9.81 [2019-03-29 01:39:22,683 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35 Second operand 4 states. 20.47/9.81 [2019-03-29 01:39:22,748 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 138 states and 250 transitions. Complement of second has 16 states. 20.47/9.81 [2019-03-29 01:39:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 20.47/9.81 [2019-03-29 01:39:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.47/9.81 [2019-03-29 01:39:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. 20.47/9.81 [2019-03-29 01:39:22,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. 20.47/9.81 [2019-03-29 01:39:22,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 12 letters. Loop has 3 letters. 20.47/9.81 [2019-03-29 01:39:22,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 6 letters. 20.47/9.81 [2019-03-29 01:39:22,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.47/9.81 [2019-03-29 01:39:22,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 250 transitions. 20.47/9.81 [2019-03-29 01:39:22,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.47/9.81 [2019-03-29 01:39:22,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.47/9.81 [2019-03-29 01:39:22,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.47/9.81 [2019-03-29 01:39:22,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.47/9.81 [2019-03-29 01:39:22,755 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,755 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 20.47/9.81 [2019-03-29 01:39:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 20.47/9.81 [2019-03-29 01:39:22,755 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. 20.47/9.81 [2019-03-29 01:39:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.47/9.81 [2019-03-29 01:39:22,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 20.47/9.81 [2019-03-29 01:39:22,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.47/9.81 [2019-03-29 01:39:22,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.47/9.81 [2019-03-29 01:39:22,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.47/9.81 [2019-03-29 01:39:22,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,758 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 20.47/9.81 [2019-03-29 01:39:22,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.47/9.81 [2019-03-29 01:39:22,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.47/9.81 [2019-03-29 01:39:22,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.47/9.81 [2019-03-29 01:39:22,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:39:22 BasicIcfg 20.47/9.81 [2019-03-29 01:39:22,765 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.47/9.81 [2019-03-29 01:39:22,765 INFO L168 Benchmark]: Toolchain (without parser) took 5195.24 ms. Allocated memory was 649.6 MB in the beginning and 758.1 MB in the end (delta: 108.5 MB). Free memory was 563.9 MB in the beginning and 385.4 MB in the end (delta: 178.5 MB). Peak memory consumption was 287.0 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,767 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.72 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 554.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.97 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 554.4 MB in the beginning and 650.0 MB in the end (delta: -95.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,769 INFO L168 Benchmark]: Boogie Preprocessor took 20.38 ms. Allocated memory is still 683.7 MB. Free memory was 650.0 MB in the beginning and 648.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,769 INFO L168 Benchmark]: RCFGBuilder took 196.35 ms. Allocated memory is still 683.7 MB. Free memory was 646.9 MB in the beginning and 632.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,770 INFO L168 Benchmark]: BlockEncodingV2 took 79.78 ms. Allocated memory is still 683.7 MB. Free memory was 632.7 MB in the beginning and 627.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,770 INFO L168 Benchmark]: TraceAbstraction took 169.83 ms. Allocated memory is still 683.7 MB. Free memory was 627.3 MB in the beginning and 617.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,771 INFO L168 Benchmark]: BuchiAutomizer took 4392.90 ms. Allocated memory was 683.7 MB in the beginning and 758.1 MB in the end (delta: 74.4 MB). Free memory was 617.9 MB in the beginning and 385.4 MB in the end (delta: 232.5 MB). Peak memory consumption was 306.9 MB. Max. memory is 50.3 GB. 20.47/9.81 [2019-03-29 01:39:22,775 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.47/9.81 --- Results --- 20.47/9.81 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.47/9.81 - StatisticsResult: Initial Icfg 20.47/9.81 10 locations, 14 edges 20.47/9.81 - StatisticsResult: Encoded RCFG 20.47/9.81 6 locations, 11 edges 20.47/9.81 * Results from de.uni_freiburg.informatik.ultimate.core: 20.47/9.81 - StatisticsResult: Toolchain Benchmarks 20.47/9.81 Benchmark results are: 20.47/9.81 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.47/9.81 * CACSL2BoogieTranslator took 234.72 ms. Allocated memory is still 649.6 MB. Free memory was 563.9 MB in the beginning and 554.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 20.47/9.81 * Boogie Procedure Inliner took 95.97 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 554.4 MB in the beginning and 650.0 MB in the end (delta: -95.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 20.47/9.81 * Boogie Preprocessor took 20.38 ms. Allocated memory is still 683.7 MB. Free memory was 650.0 MB in the beginning and 648.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 20.47/9.81 * RCFGBuilder took 196.35 ms. Allocated memory is still 683.7 MB. Free memory was 646.9 MB in the beginning and 632.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 50.3 GB. 20.47/9.81 * BlockEncodingV2 took 79.78 ms. Allocated memory is still 683.7 MB. Free memory was 632.7 MB in the beginning and 627.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.47/9.81 * TraceAbstraction took 169.83 ms. Allocated memory is still 683.7 MB. Free memory was 627.3 MB in the beginning and 617.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.47/9.81 * BuchiAutomizer took 4392.90 ms. Allocated memory was 683.7 MB in the beginning and 758.1 MB in the end (delta: 74.4 MB). Free memory was 617.9 MB in the beginning and 385.4 MB in the end (delta: 232.5 MB). Peak memory consumption was 306.9 MB. Max. memory is 50.3 GB. 20.47/9.81 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.47/9.81 - AllSpecificationsHoldResult: All specifications hold 20.47/9.81 We were not able to verify any specifiation because the program does not contain any specification. 20.47/9.81 - InvariantResult [Line: 18]: Loop Invariant 20.47/9.81 Derived loop invariant: 1 20.47/9.81 - InvariantResult [Line: 20]: Loop Invariant 20.47/9.81 Derived loop invariant: 1 20.47/9.81 - StatisticsResult: Ultimate Automizer benchmark data 20.47/9.81 CFG has 1 procedures, 6 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 20.47/9.81 - StatisticsResult: Constructed decomposition of program 20.47/9.81 Your program was decomposed into 8 terminating modules (2 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 * m + -2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. 20.47/9.81 - StatisticsResult: Timing statistics 20.47/9.81 BüchiAutomizer plugin needed 4.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 215 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 44 SDtfs, 169 SDslu, 114 SDs, 0 SdLazy, 276 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax170 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf112 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s 20.47/9.81 - TerminationAnalysisResult: Termination proven 20.47/9.81 Buchi Automizer proved that your program is terminating 20.47/9.81 RESULT: Ultimate proved your program to be correct! 20.47/9.81 !SESSION 2019-03-29 01:39:14.261 ----------------------------------------------- 20.47/9.81 eclipse.buildId=unknown 20.47/9.81 java.version=1.8.0_181 20.47/9.81 java.vendor=Oracle Corporation 20.47/9.81 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.47/9.81 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.47/9.81 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.47/9.81 20.47/9.81 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:39:23.010 20.47/9.81 !MESSAGE The workspace will exit with unsaved changes in this session. 20.47/9.81 Received shutdown request... 20.47/9.81 Ultimate: 20.47/9.81 GTK+ Version Check 20.47/9.81 EOF