25.46/12.03 YES 25.46/12.03 25.46/12.04 Ultimate: Cannot open display: 25.46/12.04 This is Ultimate 0.1.24-8dc7c08-m 25.46/12.04 [2019-03-28 22:53:30,758 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.46/12.04 [2019-03-28 22:53:30,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.46/12.04 [2019-03-28 22:53:30,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.46/12.04 [2019-03-28 22:53:30,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.46/12.04 [2019-03-28 22:53:30,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.46/12.04 [2019-03-28 22:53:30,776 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.46/12.04 [2019-03-28 22:53:30,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.46/12.04 [2019-03-28 22:53:30,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.46/12.04 [2019-03-28 22:53:30,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.46/12.04 [2019-03-28 22:53:30,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.46/12.04 [2019-03-28 22:53:30,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.46/12.04 [2019-03-28 22:53:30,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.46/12.04 [2019-03-28 22:53:30,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.46/12.04 [2019-03-28 22:53:30,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.46/12.04 [2019-03-28 22:53:30,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.46/12.04 [2019-03-28 22:53:30,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.46/12.04 [2019-03-28 22:53:30,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.46/12.04 [2019-03-28 22:53:30,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.46/12.04 [2019-03-28 22:53:30,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.46/12.04 [2019-03-28 22:53:30,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.46/12.04 [2019-03-28 22:53:30,795 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.46/12.04 [2019-03-28 22:53:30,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.46/12.04 [2019-03-28 22:53:30,796 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.46/12.04 [2019-03-28 22:53:30,797 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.46/12.04 [2019-03-28 22:53:30,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.46/12.04 [2019-03-28 22:53:30,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.46/12.04 [2019-03-28 22:53:30,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.46/12.04 [2019-03-28 22:53:30,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.46/12.04 [2019-03-28 22:53:30,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.46/12.04 [2019-03-28 22:53:30,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.46/12.04 [2019-03-28 22:53:30,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.46/12.04 [2019-03-28 22:53:30,803 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.46/12.04 [2019-03-28 22:53:30,817 INFO L110 SettingsManager]: Loading preferences was successful 25.46/12.04 [2019-03-28 22:53:30,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.46/12.04 [2019-03-28 22:53:30,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.46/12.04 [2019-03-28 22:53:30,819 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.46/12.04 [2019-03-28 22:53:30,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.46/12.04 [2019-03-28 22:53:30,819 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.46/12.04 [2019-03-28 22:53:30,820 INFO L133 SettingsManager]: * Use SBE=true 25.46/12.04 [2019-03-28 22:53:30,820 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.46/12.04 [2019-03-28 22:53:30,820 INFO L133 SettingsManager]: * Use old map elimination=false 25.46/12.04 [2019-03-28 22:53:30,820 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.46/12.04 [2019-03-28 22:53:30,820 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.46/12.04 [2019-03-28 22:53:30,821 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.46/12.04 [2019-03-28 22:53:30,821 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.46/12.04 [2019-03-28 22:53:30,821 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.46/12.04 [2019-03-28 22:53:30,821 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:30,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.46/12.04 [2019-03-28 22:53:30,822 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.46/12.04 [2019-03-28 22:53:30,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.46/12.04 [2019-03-28 22:53:30,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.46/12.04 [2019-03-28 22:53:30,822 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.46/12.04 [2019-03-28 22:53:30,822 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.46/12.04 [2019-03-28 22:53:30,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.46/12.04 [2019-03-28 22:53:30,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.46/12.04 [2019-03-28 22:53:30,823 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.46/12.04 [2019-03-28 22:53:30,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.46/12.04 [2019-03-28 22:53:30,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.46/12.04 [2019-03-28 22:53:30,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.46/12.04 [2019-03-28 22:53:30,824 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.46/12.04 [2019-03-28 22:53:30,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.46/12.04 [2019-03-28 22:53:30,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.46/12.04 [2019-03-28 22:53:30,863 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.46/12.04 [2019-03-28 22:53:30,866 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.46/12.04 [2019-03-28 22:53:30,868 INFO L271 PluginConnector]: Initializing CDTParser... 25.46/12.04 [2019-03-28 22:53:30,868 INFO L276 PluginConnector]: CDTParser initialized 25.46/12.04 [2019-03-28 22:53:30,869 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.46/12.04 [2019-03-28 22:53:30,929 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/137102996c134f95ac47637d577bfe17/FLAG4c3242c72 25.46/12.04 [2019-03-28 22:53:31,273 INFO L307 CDTParser]: Found 1 translation units. 25.46/12.04 [2019-03-28 22:53:31,273 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.46/12.04 [2019-03-28 22:53:31,280 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/137102996c134f95ac47637d577bfe17/FLAG4c3242c72 25.46/12.04 [2019-03-28 22:53:31,677 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/137102996c134f95ac47637d577bfe17 25.46/12.04 [2019-03-28 22:53:31,688 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.46/12.04 [2019-03-28 22:53:31,690 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.46/12.04 [2019-03-28 22:53:31,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.46/12.04 [2019-03-28 22:53:31,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.46/12.04 [2019-03-28 22:53:31,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.46/12.04 [2019-03-28 22:53:31,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:31,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d81c130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:31,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:31,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.46/12.04 [2019-03-28 22:53:31,725 INFO L176 MainTranslator]: Built tables and reachable declarations 25.46/12.04 [2019-03-28 22:53:31,884 INFO L206 PostProcessor]: Analyzing one entry point: main 25.46/12.04 [2019-03-28 22:53:31,888 INFO L191 MainTranslator]: Completed pre-run 25.46/12.04 [2019-03-28 22:53:31,905 INFO L206 PostProcessor]: Analyzing one entry point: main 25.46/12.04 [2019-03-28 22:53:31,982 INFO L195 MainTranslator]: Completed translation 25.46/12.04 [2019-03-28 22:53:31,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31 WrapperNode 25.46/12.04 [2019-03-28 22:53:31,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.46/12.04 [2019-03-28 22:53:31,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.46/12.04 [2019-03-28 22:53:31,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.46/12.04 [2019-03-28 22:53:31,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.46/12.04 [2019-03-28 22:53:31,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.46/12.04 [2019-03-28 22:53:32,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.46/12.04 [2019-03-28 22:53:32,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.46/12.04 [2019-03-28 22:53:32,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.46/12.04 [2019-03-28 22:53:32,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.46/12.04 [2019-03-28 22:53:32,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.46/12.04 [2019-03-28 22:53:32,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.46/12.04 [2019-03-28 22:53:32,043 INFO L276 PluginConnector]: RCFGBuilder initialized 25.46/12.04 [2019-03-28 22:53:32,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (1/1) ... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.46/12.04 [2019-03-28 22:53:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.46/12.04 [2019-03-28 22:53:32,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.46/12.04 [2019-03-28 22:53:32,247 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.46/12.04 [2019-03-28 22:53:32,247 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 25.46/12.04 [2019-03-28 22:53:32,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:53:32 BoogieIcfgContainer 25.46/12.04 [2019-03-28 22:53:32,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.46/12.04 [2019-03-28 22:53:32,249 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.46/12.04 [2019-03-28 22:53:32,249 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.46/12.04 [2019-03-28 22:53:32,252 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.46/12.04 [2019-03-28 22:53:32,253 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:53:32" (1/1) ... 25.46/12.04 [2019-03-28 22:53:32,268 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges 25.46/12.04 [2019-03-28 22:53:32,270 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.46/12.04 [2019-03-28 22:53:32,271 INFO L263 BlockEncoder]: Using Maximize final states 25.46/12.04 [2019-03-28 22:53:32,271 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.46/12.04 [2019-03-28 22:53:32,272 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.46/12.04 [2019-03-28 22:53:32,274 INFO L296 BlockEncoder]: Using Remove sink states 25.46/12.04 [2019-03-28 22:53:32,275 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.46/12.04 [2019-03-28 22:53:32,275 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.46/12.04 [2019-03-28 22:53:32,290 INFO L185 BlockEncoder]: Using Use SBE 25.46/12.04 [2019-03-28 22:53:32,298 INFO L200 BlockEncoder]: SBE split 0 edges 25.46/12.04 [2019-03-28 22:53:32,304 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 25.46/12.04 [2019-03-28 22:53:32,306 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.46/12.04 [2019-03-28 22:53:32,320 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 25.46/12.04 [2019-03-28 22:53:32,322 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.46/12.04 [2019-03-28 22:53:32,323 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.46/12.04 [2019-03-28 22:53:32,323 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.46/12.04 [2019-03-28 22:53:32,324 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.46/12.04 [2019-03-28 22:53:32,324 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.46/12.04 [2019-03-28 22:53:32,324 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges 25.46/12.04 [2019-03-28 22:53:32,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:53:32 BasicIcfg 25.46/12.04 [2019-03-28 22:53:32,325 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.46/12.04 [2019-03-28 22:53:32,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.46/12.04 [2019-03-28 22:53:32,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.46/12.04 [2019-03-28 22:53:32,329 INFO L276 PluginConnector]: TraceAbstraction initialized 25.46/12.04 [2019-03-28 22:53:32,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:53:31" (1/4) ... 25.46/12.04 [2019-03-28 22:53:32,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350da2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (2/4) ... 25.46/12.04 [2019-03-28 22:53:32,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350da2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:53:32" (3/4) ... 25.46/12.04 [2019-03-28 22:53:32,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350da2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:53:32" (4/4) ... 25.46/12.04 [2019-03-28 22:53:32,333 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.46/12.04 [2019-03-28 22:53:32,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.46/12.04 [2019-03-28 22:53:32,351 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 25.46/12.04 [2019-03-28 22:53:32,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 25.46/12.04 [2019-03-28 22:53:32,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.46/12.04 [2019-03-28 22:53:32,398 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.46/12.04 [2019-03-28 22:53:32,399 INFO L383 AbstractCegarLoop]: Hoare is true 25.46/12.04 [2019-03-28 22:53:32,399 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.46/12.04 [2019-03-28 22:53:32,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.46/12.04 [2019-03-28 22:53:32,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.46/12.04 [2019-03-28 22:53:32,399 INFO L387 AbstractCegarLoop]: Difference is false 25.46/12.04 [2019-03-28 22:53:32,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.46/12.04 [2019-03-28 22:53:32,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.46/12.04 [2019-03-28 22:53:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:32,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.46/12.04 [2019-03-28 22:53:32,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 25.46/12.04 [2019-03-28 22:53:32,472 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. 25.46/12.04 [2019-03-28 22:53:32,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.46/12.04 [2019-03-28 22:53:32,473 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 14 22) the Hoare annotation is: true 25.46/12.04 [2019-03-28 22:53:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:53:32 BasicIcfg 25.46/12.04 [2019-03-28 22:53:32,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.46/12.04 [2019-03-28 22:53:32,482 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.46/12.04 [2019-03-28 22:53:32,482 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.46/12.04 [2019-03-28 22:53:32,485 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.46/12.04 [2019-03-28 22:53:32,486 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.46/12.04 [2019-03-28 22:53:32,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:53:31" (1/5) ... 25.46/12.04 [2019-03-28 22:53:32,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59925eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.46/12.04 [2019-03-28 22:53:32,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:53:31" (2/5) ... 25.46/12.04 [2019-03-28 22:53:32,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59925eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.46/12.04 [2019-03-28 22:53:32,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:53:32" (3/5) ... 25.46/12.04 [2019-03-28 22:53:32,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59925eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.46/12.04 [2019-03-28 22:53:32,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:53:32" (4/5) ... 25.46/12.04 [2019-03-28 22:53:32,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59925eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:53:32, skipping insertion in model container 25.46/12.04 [2019-03-28 22:53:32,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.46/12.04 [2019-03-28 22:53:32,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:53:32" (5/5) ... 25.46/12.04 [2019-03-28 22:53:32,491 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.46/12.04 [2019-03-28 22:53:32,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.46/12.04 [2019-03-28 22:53:32,519 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.46/12.04 [2019-03-28 22:53:32,519 INFO L375 BuchiCegarLoop]: Hoare is true 25.46/12.04 [2019-03-28 22:53:32,519 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.46/12.04 [2019-03-28 22:53:32,520 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.46/12.04 [2019-03-28 22:53:32,520 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.46/12.04 [2019-03-28 22:53:32,520 INFO L379 BuchiCegarLoop]: Difference is false 25.46/12.04 [2019-03-28 22:53:32,520 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.46/12.04 [2019-03-28 22:53:32,520 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.46/12.04 [2019-03-28 22:53:32,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:32,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 25.46/12.04 [2019-03-28 22:53:32,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:32,541 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:32,546 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 25.46/12.04 [2019-03-28 22:53:32,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 25.46/12.04 [2019-03-28 22:53:32,562 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.46/12.04 [2019-03-28 22:53:32,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:32,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 25.46/12.04 [2019-03-28 22:53:32,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:32,563 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:32,563 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 25.46/12.04 [2019-03-28 22:53:32,563 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 25.46/12.04 [2019-03-28 22:53:32,568 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 5#L15-2true 25.46/12.04 [2019-03-28 22:53:32,569 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-2true [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3#L15true [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 5#L15-2true 25.46/12.04 [2019-03-28 22:53:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash 57, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:32,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:32,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:32,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:32,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 55772, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:32,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:32,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:32,724 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:32,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:32,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:32,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:32,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:32,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:32,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:32,726 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:32,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.46/12.04 [2019-03-28 22:53:32,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:32,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:32,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:32,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:32,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:32,886 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:32,887 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:32,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:32,893 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:32,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:32,927 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:32,944 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:32,944 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:32,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:32,972 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:33,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:33,001 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,005 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:33,034 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:33,034 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,039 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,070 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:33,100 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:33,102 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:33,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:33,103 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:33,103 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:33,103 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:33,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:33,103 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:33,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.46/12.04 [2019-03-28 22:53:33,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:33,104 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,215 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:33,221 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:33,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:33,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:33,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:33,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:33,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:33,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,274 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:33,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:33,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 25.46/12.04 [2019-03-28 22:53:33,281 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:33,282 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:33,282 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:33,282 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:33,284 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:33,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:33,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:33,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:33,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:33,355 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:33,360 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 25.46/12.04 [2019-03-28 22:53:33,361 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 25.46/12.04 [2019-03-28 22:53:33,386 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. 25.46/12.04 [2019-03-28 22:53:33,386 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 25.46/12.04 [2019-03-28 22:53:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 25.46/12.04 [2019-03-28 22:53:33,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:33,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:33,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. 25.46/12.04 [2019-03-28 22:53:33,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 25.46/12.04 [2019-03-28 22:53:33,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:33,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 25.46/12.04 [2019-03-28 22:53:33,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:33,405 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 25.46/12.04 [2019-03-28 22:53:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.46/12.04 [2019-03-28 22:53:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,434 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,434 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,434 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.46/12.04 [2019-03-28 22:53:33,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. 25.46/12.04 [2019-03-28 22:53:33,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 25.46/12.04 [2019-03-28 22:53:33,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:33,435 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:33,435 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.46/12.04 [2019-03-28 22:53:33,436 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 25.46/12.04 [2019-03-28 22:53:33,436 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 46#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 41#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 25.46/12.04 [2019-03-28 22:53:33,436 INFO L796 eck$LassoCheckResult]: Loop: 42#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 47#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 25.46/12.04 [2019-03-28 22:53:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 55762, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:33,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 2 times 25.46/12.04 [2019-03-28 22:53:33,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 53588277, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:33,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:33,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.46/12.04 [2019-03-28 22:53:33,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.46/12.04 [2019-03-28 22:53:33,522 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:33,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:33,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:33,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:33,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:33,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:33,523 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:33,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 25.46/12.04 [2019-03-28 22:53:33,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:33,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,601 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:33,601 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,606 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:33,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:33,633 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,639 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:33,671 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:33,701 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:33,703 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:33,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:33,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:33,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:33,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:33,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:33,704 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:33,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 25.46/12.04 [2019-03-28 22:53:33,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:33,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:33,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,786 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:33,786 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:33,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:33,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:33,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:33,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:33,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:33,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:33,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:33,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:33,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:33,802 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:33,806 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:33,806 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 25.46/12.04 [2019-03-28 22:53:33,806 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:33,807 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:33,807 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:33,807 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:33,807 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:33,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:33,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:33,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:33,845 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:33,845 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 25.46/12.04 [2019-03-28 22:53:33,846 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. 25.46/12.04 [2019-03-28 22:53:33,858 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. 25.46/12.04 [2019-03-28 22:53:33,858 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 25.46/12.04 [2019-03-28 22:53:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 25.46/12.04 [2019-03-28 22:53:33,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:33,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:33,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. 25.46/12.04 [2019-03-28 22:53:33,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:33,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. 25.46/12.04 [2019-03-28 22:53:33,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.46/12.04 [2019-03-28 22:53:33,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. 25.46/12.04 [2019-03-28 22:53:33,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:33,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 25.46/12.04 [2019-03-28 22:53:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. 25.46/12.04 [2019-03-28 22:53:33,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:33,864 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. 25.46/12.04 [2019-03-28 22:53:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. 25.46/12.04 [2019-03-28 22:53:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. 25.46/12.04 [2019-03-28 22:53:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.46/12.04 [2019-03-28 22:53:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. 25.46/12.04 [2019-03-28 22:53:33,866 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 25.46/12.04 [2019-03-28 22:53:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.46/12.04 [2019-03-28 22:53:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.46/12.04 [2019-03-28 22:53:33,870 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. 25.46/12.04 [2019-03-28 22:53:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.46/12.04 [2019-03-28 22:53:33,892 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. 25.46/12.04 [2019-03-28 22:53:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.46/12.04 [2019-03-28 22:53:33,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. 25.46/12.04 [2019-03-28 22:53:33,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.46/12.04 [2019-03-28 22:53:33,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:33,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:33,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:33,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:33,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:33,895 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. 25.46/12.04 [2019-03-28 22:53:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 25.46/12.04 [2019-03-28 22:53:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. 25.46/12.04 [2019-03-28 22:53:33,897 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. 25.46/12.04 [2019-03-28 22:53:33,897 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. 25.46/12.04 [2019-03-28 22:53:33,897 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.46/12.04 [2019-03-28 22:53:33,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. 25.46/12.04 [2019-03-28 22:53:33,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.46/12.04 [2019-03-28 22:53:33,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:33,898 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:33,898 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 25.46/12.04 [2019-03-28 22:53:33,898 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 25.46/12.04 [2019-03-28 22:53:33,899 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 112#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 109#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 110#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 25.46/12.04 [2019-03-28 22:53:33,899 INFO L796 eck$LassoCheckResult]: Loop: 107#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 108#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 25.46/12.04 [2019-03-28 22:53:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 2 times 25.46/12.04 [2019-03-28 22:53:33,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1736, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:33,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1661534218, now seen corresponding path program 2 times 25.46/12.04 [2019-03-28 22:53:33,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:33,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:33,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:33,946 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:33,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:33,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:33,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:33,947 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:33,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:33,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:33,947 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:33,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 25.46/12.04 [2019-03-28 22:53:33,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:33,948 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:33,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:33,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,016 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:34,017 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,023 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:34,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:34,051 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,057 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,090 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:34,168 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:34,171 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:34,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:34,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:34,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:34,172 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:34,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:34,172 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:34,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 25.46/12.04 [2019-03-28 22:53:34,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:34,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:34,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,252 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:34,252 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:34,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:34,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:34,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:34,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:34,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:34,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:34,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:34,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:34,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:34,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:34,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:34,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:34,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:34,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:34,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:34,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:34,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:34,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:34,272 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 25.46/12.04 [2019-03-28 22:53:34,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:34,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:34,273 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:34,273 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:34,273 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:34,321 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:34,322 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 25.46/12.04 [2019-03-28 22:53:34,322 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. 25.46/12.04 [2019-03-28 22:53:34,346 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 4 states. 25.46/12.04 [2019-03-28 22:53:34,346 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 25.46/12.04 [2019-03-28 22:53:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.46/12.04 [2019-03-28 22:53:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 25.46/12.04 [2019-03-28 22:53:34,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:34,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. 25.46/12.04 [2019-03-28 22:53:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. 25.46/12.04 [2019-03-28 22:53:34,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. 25.46/12.04 [2019-03-28 22:53:34,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 25.46/12.04 [2019-03-28 22:53:34,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 12 transitions. 25.46/12.04 [2019-03-28 22:53:34,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 25.46/12.04 [2019-03-28 22:53:34,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 25.46/12.04 [2019-03-28 22:53:34,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. 25.46/12.04 [2019-03-28 22:53:34,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:34,352 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. 25.46/12.04 [2019-03-28 22:53:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:34,353 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.46/12.04 [2019-03-28 22:53:34,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. 25.46/12.04 [2019-03-28 22:53:34,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.46/12.04 [2019-03-28 22:53:34,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:34,354 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:34,355 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 25.46/12.04 [2019-03-28 22:53:34,355 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] 25.46/12.04 [2019-03-28 22:53:34,355 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 166#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 25.46/12.04 [2019-03-28 22:53:34,355 INFO L796 eck$LassoCheckResult]: Loop: 161#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 162#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 25.46/12.04 [2019-03-28 22:53:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 3 times 25.46/12.04 [2019-03-28 22:53:34,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1669381, now seen corresponding path program 1 times 25.46/12.04 [2019-03-28 22:53:34,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -993449529, now seen corresponding path program 3 times 25.46/12.04 [2019-03-28 22:53:34,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,435 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:34,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:34,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:34,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:34,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:34,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:34,436 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:34,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 25.46/12.04 [2019-03-28 22:53:34,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:34,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:34,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,532 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:34,533 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,539 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:34,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:34,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,572 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:34,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:34,599 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=2} Honda state: {ULTIMATE.start_main_~c~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,603 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:34,633 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:34,637 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:34,661 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:34,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:34,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:34,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:34,662 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:34,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:34,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:34,662 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:34,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 25.46/12.04 [2019-03-28 22:53:34,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:34,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:34,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:34,720 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:34,720 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:34,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:34,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:34,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:34,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:34,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:34,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:34,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:34,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:34,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:34,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:34,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:34,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:34,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:34,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:34,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:34,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:34,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.46/12.04 [2019-03-28 22:53:34,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:34,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:34,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:34,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:34,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:34,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:34,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:34,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:34,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:34,741 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:34,742 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 25.46/12.04 [2019-03-28 22:53:34,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:34,742 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:34,742 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:34,742 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 221 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:34,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,833 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:34,834 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 25.46/12.04 [2019-03-28 22:53:34,834 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. 25.46/12.04 [2019-03-28 22:53:34,862 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. 25.46/12.04 [2019-03-28 22:53:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 25.46/12.04 [2019-03-28 22:53:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.46/12.04 [2019-03-28 22:53:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. 25.46/12.04 [2019-03-28 22:53:34,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. 25.46/12.04 [2019-03-28 22:53:34,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. 25.46/12.04 [2019-03-28 22:53:34,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. 25.46/12.04 [2019-03-28 22:53:34,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:34,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. 25.46/12.04 [2019-03-28 22:53:34,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 25.46/12.04 [2019-03-28 22:53:34,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. 25.46/12.04 [2019-03-28 22:53:34,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:34,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:34,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. 25.46/12.04 [2019-03-28 22:53:34,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:34,870 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 25.46/12.04 [2019-03-28 22:53:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. 25.46/12.04 [2019-03-28 22:53:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 25.46/12.04 [2019-03-28 22:53:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.46/12.04 [2019-03-28 22:53:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 25.46/12.04 [2019-03-28 22:53:34,872 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 25.46/12.04 [2019-03-28 22:53:34,872 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 25.46/12.04 [2019-03-28 22:53:34,872 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.46/12.04 [2019-03-28 22:53:34,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. 25.46/12.04 [2019-03-28 22:53:34,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 25.46/12.04 [2019-03-28 22:53:34,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:34,873 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:34,874 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 25.46/12.04 [2019-03-28 22:53:34,874 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] 25.46/12.04 [2019-03-28 22:53:34,874 INFO L794 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 253#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 256#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 257#L15 25.46/12.04 [2019-03-28 22:53:34,874 INFO L796 eck$LassoCheckResult]: Loop: 257#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 260#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 259#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 258#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 256#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 257#L15 25.46/12.04 [2019-03-28 22:53:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 4 times 25.46/12.04 [2019-03-28 22:53:34,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1603978316, now seen corresponding path program 2 times 25.46/12.04 [2019-03-28 22:53:34,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1222554482, now seen corresponding path program 4 times 25.46/12.04 [2019-03-28 22:53:34,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:34,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:34,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.46/12.04 [2019-03-28 22:53:34,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.46/12.04 [2019-03-28 22:53:34,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 25.46/12.04 [2019-03-28 22:53:34,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 25.46/12.04 [2019-03-28 22:53:34,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:34,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:34,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:34,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.46/12.04 [2019-03-28 22:53:34,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 25.46/12.04 [2019-03-28 22:53:35,052 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:35,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:35,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:35,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:35,053 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:35,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:35,054 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:35,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 25.46/12.04 [2019-03-28 22:53:35,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:35,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:35,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,118 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:35,118 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:35,126 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:35,156 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:35,187 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:35,188 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:35,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:35,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:35,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:35,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:35,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:35,189 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:35,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 25.46/12.04 [2019-03-28 22:53:35,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:35,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:35,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,252 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:35,252 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:35,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:35,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:35,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:35,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:35,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:35,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:35,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:35,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:35,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:35,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:35,260 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 25.46/12.04 [2019-03-28 22:53:35,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:35,261 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:35,261 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:35,261 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:35,262 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:35,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:35,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:35,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:35,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:35,369 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:35,369 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 7 loop predicates 25.46/12.04 [2019-03-28 22:53:35,369 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. 25.46/12.04 [2019-03-28 22:53:35,406 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 63 states and 78 transitions. Complement of second has 14 states. 25.46/12.04 [2019-03-28 22:53:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.46/12.04 [2019-03-28 22:53:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.46/12.04 [2019-03-28 22:53:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. 25.46/12.04 [2019-03-28 22:53:35,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. 25.46/12.04 [2019-03-28 22:53:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. 25.46/12.04 [2019-03-28 22:53:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. 25.46/12.04 [2019-03-28 22:53:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:35,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. 25.46/12.04 [2019-03-28 22:53:35,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 25.46/12.04 [2019-03-28 22:53:35,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 37 states and 50 transitions. 25.46/12.04 [2019-03-28 22:53:35,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 25.46/12.04 [2019-03-28 22:53:35,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 25.46/12.04 [2019-03-28 22:53:35,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. 25.46/12.04 [2019-03-28 22:53:35,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:35,416 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. 25.46/12.04 [2019-03-28 22:53:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. 25.46/12.04 [2019-03-28 22:53:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. 25.46/12.04 [2019-03-28 22:53:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 25.46/12.04 [2019-03-28 22:53:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,420 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.46/12.04 [2019-03-28 22:53:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 25.46/12.04 [2019-03-28 22:53:35,420 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 5 states. 25.46/12.04 [2019-03-28 22:53:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.46/12.04 [2019-03-28 22:53:35,435 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. 25.46/12.04 [2019-03-28 22:53:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.46/12.04 [2019-03-28 22:53:35,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. 25.46/12.04 [2019-03-28 22:53:35,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 25.46/12.04 [2019-03-28 22:53:35,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 37 states and 51 transitions. 25.46/12.04 [2019-03-28 22:53:35,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 25.46/12.04 [2019-03-28 22:53:35,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 25.46/12.04 [2019-03-28 22:53:35,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. 25.46/12.04 [2019-03-28 22:53:35,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:35,440 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. 25.46/12.04 [2019-03-28 22:53:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. 25.46/12.04 [2019-03-28 22:53:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. 25.46/12.04 [2019-03-28 22:53:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 25.46/12.04 [2019-03-28 22:53:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. 25.46/12.04 [2019-03-28 22:53:35,443 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. 25.46/12.04 [2019-03-28 22:53:35,443 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. 25.46/12.04 [2019-03-28 22:53:35,443 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.46/12.04 [2019-03-28 22:53:35,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. 25.46/12.04 [2019-03-28 22:53:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 25.46/12.04 [2019-03-28 22:53:35,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:35,444 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:35,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] 25.46/12.04 [2019-03-28 22:53:35,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] 25.46/12.04 [2019-03-28 22:53:35,445 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 539#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 554#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 555#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 543#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 540#L15-2 25.46/12.04 [2019-03-28 22:53:35,446 INFO L796 eck$LassoCheckResult]: Loop: 540#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 541#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 559#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 558#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 556#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 547#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 544#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 543#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 540#L15-2 25.46/12.04 [2019-03-28 22:53:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 5 times 25.46/12.04 [2019-03-28 22:53:35,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:35,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1415935609, now seen corresponding path program 3 times 25.46/12.04 [2019-03-28 22:53:35,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.46/12.04 [2019-03-28 22:53:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.46/12.04 [2019-03-28 22:53:35,473 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.46/12.04 [2019-03-28 22:53:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.46/12.04 [2019-03-28 22:53:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.46/12.04 [2019-03-28 22:53:35,474 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 14 Second operand 4 states. 25.46/12.04 [2019-03-28 22:53:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.46/12.04 [2019-03-28 22:53:35,487 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. 25.46/12.04 [2019-03-28 22:53:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.46/12.04 [2019-03-28 22:53:35,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. 25.46/12.04 [2019-03-28 22:53:35,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 25.46/12.04 [2019-03-28 22:53:35,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 32 states and 40 transitions. 25.46/12.04 [2019-03-28 22:53:35,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 25.46/12.04 [2019-03-28 22:53:35,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.46/12.04 [2019-03-28 22:53:35,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. 25.46/12.04 [2019-03-28 22:53:35,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:35,491 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. 25.46/12.04 [2019-03-28 22:53:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. 25.46/12.04 [2019-03-28 22:53:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. 25.46/12.04 [2019-03-28 22:53:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 25.46/12.04 [2019-03-28 22:53:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,494 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,494 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,494 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 25.46/12.04 [2019-03-28 22:53:35,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. 25.46/12.04 [2019-03-28 22:53:35,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 25.46/12.04 [2019-03-28 22:53:35,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:35,495 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:35,496 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] 25.46/12.04 [2019-03-28 22:53:35,496 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 6, 4] 25.46/12.04 [2019-03-28 22:53:35,496 INFO L794 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 620#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 639#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 629#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 624#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 621#L15-2 25.46/12.04 [2019-03-28 22:53:35,497 INFO L796 eck$LassoCheckResult]: Loop: 621#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 615#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 616#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 643#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 642#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 641#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 640#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 638#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 637#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 634#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 636#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 635#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 633#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 632#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 631#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 630#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 628#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 626#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 627#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 623#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 621#L15-2 25.46/12.04 [2019-03-28 22:53:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 6 times 25.46/12.04 [2019-03-28 22:53:35,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:35,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1241163421, now seen corresponding path program 4 times 25.46/12.04 [2019-03-28 22:53:35,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:35,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1836475681, now seen corresponding path program 5 times 25.46/12.04 [2019-03-28 22:53:35,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:35,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.46/12.04 [2019-03-28 22:53:35,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.46/12.04 [2019-03-28 22:53:35,597 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 25.46/12.04 [2019-03-28 22:53:35,616 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) 25.46/12.04 [2019-03-28 22:53:35,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:35,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:35,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:35,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.46/12.04 [2019-03-28 22:53:35,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 25.46/12.04 [2019-03-28 22:53:35,889 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 25.46/12.04 [2019-03-28 22:53:35,900 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:35,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:35,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:35,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:35,901 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:35,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:35,901 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:35,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 25.46/12.04 [2019-03-28 22:53:35,902 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:35,902 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:35,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:35,954 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:35,954 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:35,960 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:35,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:35,987 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:35,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:35,991 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:36,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.46/12.04 [2019-03-28 22:53:36,019 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: [] 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:36,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:36,023 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:36,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:36,052 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:36,139 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:36,141 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:36,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:36,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:36,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:36,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:36,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:36,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:36,142 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:36,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 25.46/12.04 [2019-03-28 22:53:36,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:36,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:36,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:36,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:36,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:36,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:36,199 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:36,199 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:36,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:36,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:36,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:36,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:36,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:36,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:36,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:36,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:36,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:36,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:36,205 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 25.46/12.04 [2019-03-28 22:53:36,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:36,206 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:36,206 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:36,206 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:36,206 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:36,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:36,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:36,995 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 20 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:36,995 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 20 loop predicates 25.46/12.04 [2019-03-28 22:53:36,995 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10 Second operand 7 states. 25.46/12.04 [2019-03-28 22:53:37,731 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 506 states and 572 transitions. Complement of second has 170 states. 25.46/12.04 [2019-03-28 22:53:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 17 non-accepting loop states 3 accepting loop states 25.46/12.04 [2019-03-28 22:53:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.46/12.04 [2019-03-28 22:53:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. 25.46/12.04 [2019-03-28 22:53:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 20 letters. 25.46/12.04 [2019-03-28 22:53:37,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 25 letters. Loop has 20 letters. 25.46/12.04 [2019-03-28 22:53:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:37,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 40 letters. 25.46/12.04 [2019-03-28 22:53:37,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:37,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 572 transitions. 25.46/12.04 [2019-03-28 22:53:37,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 25.46/12.04 [2019-03-28 22:53:37,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 46 states and 52 transitions. 25.46/12.04 [2019-03-28 22:53:37,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 25.46/12.04 [2019-03-28 22:53:37,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 25.46/12.04 [2019-03-28 22:53:37,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 52 transitions. 25.46/12.04 [2019-03-28 22:53:37,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:37,803 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. 25.46/12.04 [2019-03-28 22:53:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 52 transitions. 25.46/12.04 [2019-03-28 22:53:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. 25.46/12.04 [2019-03-28 22:53:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 25.46/12.04 [2019-03-28 22:53:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. 25.46/12.04 [2019-03-28 22:53:37,806 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. 25.46/12.04 [2019-03-28 22:53:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 25.46/12.04 [2019-03-28 22:53:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 25.46/12.04 [2019-03-28 22:53:37,806 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 15 states. 25.46/12.04 [2019-03-28 22:53:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.46/12.04 [2019-03-28 22:53:38,026 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. 25.46/12.04 [2019-03-28 22:53:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 25.46/12.04 [2019-03-28 22:53:38,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 78 transitions. 25.46/12.04 [2019-03-28 22:53:38,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 25.46/12.04 [2019-03-28 22:53:38,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 34 states and 39 transitions. 25.46/12.04 [2019-03-28 22:53:38,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 25.46/12.04 [2019-03-28 22:53:38,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.46/12.04 [2019-03-28 22:53:38,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. 25.46/12.04 [2019-03-28 22:53:38,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.46/12.04 [2019-03-28 22:53:38,031 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. 25.46/12.04 [2019-03-28 22:53:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. 25.46/12.04 [2019-03-28 22:53:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. 25.46/12.04 [2019-03-28 22:53:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 25.46/12.04 [2019-03-28 22:53:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. 25.46/12.04 [2019-03-28 22:53:38,033 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. 25.46/12.04 [2019-03-28 22:53:38,033 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. 25.46/12.04 [2019-03-28 22:53:38,034 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 25.46/12.04 [2019-03-28 22:53:38,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. 25.46/12.04 [2019-03-28 22:53:38,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 25.46/12.04 [2019-03-28 22:53:38,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.46/12.04 [2019-03-28 22:53:38,034 INFO L119 BuchiIsEmpty]: Starting construction of run 25.46/12.04 [2019-03-28 22:53:38,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1] 25.46/12.04 [2019-03-28 22:53:38,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] 25.46/12.04 [2019-03-28 22:53:38,036 INFO L794 eck$LassoCheckResult]: Stem: 2712#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 2713#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2726#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2725#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2724#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2723#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2719#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2718#L15-2 25.46/12.04 [2019-03-28 22:53:38,036 INFO L796 eck$LassoCheckResult]: Loop: 2718#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2721#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2722#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2729#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2727#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2728#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2714#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2715#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2734#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2732#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2733#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2710#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2711#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2716#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2731#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2730#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2709#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2717#L15 [34] L15-->L15-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2718#L15-2 25.46/12.04 [2019-03-28 22:53:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash -32037150, now seen corresponding path program 7 times 25.46/12.04 [2019-03-28 22:53:38,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:38,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:38,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -631458422, now seen corresponding path program 5 times 25.46/12.04 [2019-03-28 22:53:38,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:38,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:38,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash 771114539, now seen corresponding path program 6 times 25.46/12.04 [2019-03-28 22:53:38,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.46/12.04 [2019-03-28 22:53:38,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.46/12.04 [2019-03-28 22:53:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.46/12.04 [2019-03-28 22:53:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.46/12.04 [2019-03-28 22:53:38,219 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 25.46/12.04 [2019-03-28 22:53:38,232 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:38,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:38,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:38,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:38,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.46/12.04 [2019-03-28 22:53:38,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:38,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:38,233 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:38,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 25.46/12.04 [2019-03-28 22:53:38,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:38,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,289 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:38,289 INFO L412 LassoAnalysis]: Checking for nontermination... 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:38,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:38,292 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.46/12.04 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.46/12.04 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:38,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.46/12.04 [2019-03-28 22:53:38,321 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.46/12.04 [2019-03-28 22:53:38,397 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.46/12.04 [2019-03-28 22:53:38,398 INFO L216 LassoAnalysis]: Preferences: 25.46/12.04 [2019-03-28 22:53:38,399 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.46/12.04 [2019-03-28 22:53:38,399 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.46/12.04 [2019-03-28 22:53:38,399 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.46/12.04 [2019-03-28 22:53:38,399 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.46/12.04 [2019-03-28 22:53:38,399 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.46/12.04 [2019-03-28 22:53:38,399 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.46/12.04 [2019-03-28 22:53:38,399 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.46/12.04 [2019-03-28 22:53:38,399 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 25.46/12.04 [2019-03-28 22:53:38,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.46/12.04 [2019-03-28 22:53:38,400 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.46/12.04 [2019-03-28 22:53:38,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.46/12.04 [2019-03-28 22:53:38,452 INFO L300 LassoAnalysis]: Preprocessing complete. 25.46/12.04 [2019-03-28 22:53:38,452 INFO L497 LassoAnalysis]: Using template 'affine'. 25.46/12.04 [2019-03-28 22:53:38,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.46/12.04 Termination analysis: LINEAR_WITH_GUESSES 25.46/12.04 Number of strict supporting invariants: 0 25.46/12.04 Number of non-strict supporting invariants: 1 25.46/12.04 Consider only non-deceasing supporting invariants: true 25.46/12.04 Simplify termination arguments: true 25.46/12.04 Simplify supporting invariants: trueOverapproximate stem: false 25.46/12.04 [2019-03-28 22:53:38,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.46/12.04 [2019-03-28 22:53:38,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.46/12.04 [2019-03-28 22:53:38,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.46/12.04 [2019-03-28 22:53:38,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.46/12.04 [2019-03-28 22:53:38,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.46/12.04 [2019-03-28 22:53:38,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.46/12.04 [2019-03-28 22:53:38,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.46/12.04 [2019-03-28 22:53:38,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.46/12.04 [2019-03-28 22:53:38,458 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.46/12.04 [2019-03-28 22:53:38,458 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 25.46/12.04 [2019-03-28 22:53:38,458 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.46/12.04 [2019-03-28 22:53:38,458 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.46/12.04 [2019-03-28 22:53:38,458 INFO L518 LassoAnalysis]: Proved termination. 25.46/12.04 [2019-03-28 22:53:38,458 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.46/12.04 Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 25.46/12.04 Supporting invariants [] 25.46/12.04 [2019-03-28 22:53:38,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.46/12.04 [2019-03-28 22:53:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.46/12.04 [2019-03-28 22:53:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 25.46/12.04 [2019-03-28 22:53:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:38,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:38,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.46/12.04 [2019-03-28 22:53:39,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core 25.46/12.04 [2019-03-28 22:53:39,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.46/12.04 [2019-03-28 22:53:39,160 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization 25.46/12.04 [2019-03-28 22:53:39,161 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 8 loop predicates 25.46/12.04 [2019-03-28 22:53:39,161 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand 8 states. 25.46/12.04 [2019-03-28 22:53:39,246 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 124 states and 147 transitions. Complement of second has 32 states. 25.46/12.04 [2019-03-28 22:53:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 25.46/12.04 [2019-03-28 22:53:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 25.46/12.04 [2019-03-28 22:53:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. 25.46/12.04 [2019-03-28 22:53:39,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 7 letters. Loop has 18 letters. 25.46/12.04 [2019-03-28 22:53:39,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:39,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 25 letters. Loop has 18 letters. 25.46/12.04 [2019-03-28 22:53:39,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:39,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 7 letters. Loop has 36 letters. 25.46/12.04 [2019-03-28 22:53:39,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.46/12.04 [2019-03-28 22:53:39,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 147 transitions. 25.46/12.04 [2019-03-28 22:53:39,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.46/12.04 [2019-03-28 22:53:39,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.46/12.04 [2019-03-28 22:53:39,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.46/12.04 [2019-03-28 22:53:39,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,252 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 25.46/12.04 [2019-03-28 22:53:39,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.46/12.04 [2019-03-28 22:53:39,253 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.46/12.04 [2019-03-28 22:53:39,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.46/12.04 [2019-03-28 22:53:39,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:53:39 BasicIcfg 25.46/12.04 [2019-03-28 22:53:39,259 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.46/12.04 [2019-03-28 22:53:39,260 INFO L168 Benchmark]: Toolchain (without parser) took 7570.87 ms. Allocated memory was 649.6 MB in the beginning and 852.0 MB in the end (delta: 202.4 MB). Free memory was 563.9 MB in the beginning and 651.0 MB in the end (delta: -87.1 MB). Peak memory consumption was 115.3 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,261 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. 25.46/12.04 [2019-03-28 22:53:39,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.81 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 563.9 MB in the beginning and 624.4 MB in the end (delta: -60.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.83 ms. Allocated memory is still 658.0 MB. Free memory was 624.4 MB in the beginning and 623.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,262 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 658.0 MB. Free memory was 623.0 MB in the beginning and 619.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,263 INFO L168 Benchmark]: RCFGBuilder took 206.18 ms. Allocated memory is still 658.0 MB. Free memory was 619.9 MB in the beginning and 606.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,263 INFO L168 Benchmark]: BlockEncodingV2 took 76.14 ms. Allocated memory is still 658.0 MB. Free memory was 606.9 MB in the beginning and 602.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,263 INFO L168 Benchmark]: TraceAbstraction took 155.47 ms. Allocated memory is still 658.0 MB. Free memory was 601.6 MB in the beginning and 593.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,264 INFO L168 Benchmark]: BuchiAutomizer took 6777.29 ms. Allocated memory was 658.0 MB in the beginning and 852.0 MB in the end (delta: 194.0 MB). Free memory was 593.5 MB in the beginning and 651.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 136.4 MB. Max. memory is 50.3 GB. 25.46/12.04 [2019-03-28 22:53:39,268 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.46/12.04 --- Results --- 25.46/12.04 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.46/12.04 - StatisticsResult: Initial Icfg 25.46/12.04 7 locations, 9 edges 25.46/12.04 - StatisticsResult: Encoded RCFG 25.46/12.04 3 locations, 4 edges 25.46/12.04 * Results from de.uni_freiburg.informatik.ultimate.core: 25.46/12.04 - StatisticsResult: Toolchain Benchmarks 25.46/12.04 Benchmark results are: 25.46/12.04 * 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. 25.46/12.04 * CACSL2BoogieTranslator took 291.81 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 563.9 MB in the beginning and 624.4 MB in the end (delta: -60.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 25.46/12.05 * Boogie Procedure Inliner took 37.83 ms. Allocated memory is still 658.0 MB. Free memory was 624.4 MB in the beginning and 623.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.46/12.05 * Boogie Preprocessor took 20.66 ms. Allocated memory is still 658.0 MB. Free memory was 623.0 MB in the beginning and 619.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 25.46/12.05 * RCFGBuilder took 206.18 ms. Allocated memory is still 658.0 MB. Free memory was 619.9 MB in the beginning and 606.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 25.46/12.05 * BlockEncodingV2 took 76.14 ms. Allocated memory is still 658.0 MB. Free memory was 606.9 MB in the beginning and 602.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 25.46/12.05 * TraceAbstraction took 155.47 ms. Allocated memory is still 658.0 MB. Free memory was 601.6 MB in the beginning and 593.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 25.46/12.05 * BuchiAutomizer took 6777.29 ms. Allocated memory was 658.0 MB in the beginning and 852.0 MB in the end (delta: 194.0 MB). Free memory was 593.5 MB in the beginning and 651.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 136.4 MB. Max. memory is 50.3 GB. 25.46/12.05 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.46/12.05 - AllSpecificationsHoldResult: All specifications hold 25.46/12.05 We were not able to verify any specifiation because the program does not contain any specification. 25.46/12.05 - InvariantResult [Line: 14]: Loop Invariant 25.46/12.05 Derived loop invariant: 1 25.46/12.05 - StatisticsResult: Ultimate Automizer benchmark data 25.46/12.05 CFG has 1 procedures, 3 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=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 25.46/12.05 - StatisticsResult: Constructed decomposition of program 25.46/12.05 Your program was decomposed into 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 221 and consists of 4 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 22 locations. One nondeterministic module has affine ranking function c and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. 25.46/12.05 - StatisticsResult: Timing statistics 25.46/12.05 BüchiAutomizer plugin needed 6.7s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 140/170 HoareTripleCheckerStatistics: 36 SDtfs, 65 SDslu, 23 SDs, 0 SdLazy, 283 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 25.46/12.05 - TerminationAnalysisResult: Termination proven 25.46/12.05 Buchi Automizer proved that your program is terminating 25.46/12.05 RESULT: Ultimate proved your program to be correct! 25.46/12.05 !SESSION 2019-03-28 22:53:28.399 ----------------------------------------------- 25.46/12.05 eclipse.buildId=unknown 25.46/12.05 java.version=1.8.0_181 25.46/12.05 java.vendor=Oracle Corporation 25.46/12.05 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.46/12.05 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.46/12.05 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 25.46/12.05 25.46/12.05 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:53:39.502 25.46/12.05 !MESSAGE The workspace will exit with unsaved changes in this session. 25.46/12.05 Received shutdown request... 25.46/12.05 Ultimate: 25.46/12.05 GTK+ Version Check 25.46/12.05 EOF