236.20/194.01 NO 236.20/194.01 236.20/194.01 Ultimate: Cannot open display: 236.20/194.01 This is Ultimate 0.1.24-8dc7c08-m 236.20/194.01 [2019-03-29 02:13:58,728 INFO L170 SettingsManager]: Resetting all preferences to default values... 236.20/194.01 [2019-03-29 02:13:58,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 236.20/194.01 [2019-03-29 02:13:58,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 236.20/194.01 [2019-03-29 02:13:58,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 236.20/194.01 [2019-03-29 02:13:58,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 236.20/194.01 [2019-03-29 02:13:58,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 236.20/194.01 [2019-03-29 02:13:58,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 236.20/194.01 [2019-03-29 02:13:58,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 236.20/194.01 [2019-03-29 02:13:58,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 236.20/194.01 [2019-03-29 02:13:58,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 236.20/194.01 [2019-03-29 02:13:58,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 236.20/194.01 [2019-03-29 02:13:58,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 236.20/194.01 [2019-03-29 02:13:58,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 236.20/194.01 [2019-03-29 02:13:58,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 236.20/194.01 [2019-03-29 02:13:58,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 236.20/194.01 [2019-03-29 02:13:58,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 236.20/194.01 [2019-03-29 02:13:58,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 236.20/194.01 [2019-03-29 02:13:58,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 236.20/194.01 [2019-03-29 02:13:58,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 236.20/194.01 [2019-03-29 02:13:58,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 236.20/194.01 [2019-03-29 02:13:58,763 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 236.20/194.01 [2019-03-29 02:13:58,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 236.20/194.01 [2019-03-29 02:13:58,764 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 236.20/194.01 [2019-03-29 02:13:58,765 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 236.20/194.01 [2019-03-29 02:13:58,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 236.20/194.01 [2019-03-29 02:13:58,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 236.20/194.01 [2019-03-29 02:13:58,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 236.20/194.01 [2019-03-29 02:13:58,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 236.20/194.01 [2019-03-29 02:13:58,769 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 236.20/194.01 [2019-03-29 02:13:58,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 236.20/194.01 [2019-03-29 02:13:58,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 236.20/194.01 [2019-03-29 02:13:58,771 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 236.20/194.01 [2019-03-29 02:13:58,785 INFO L110 SettingsManager]: Loading preferences was successful 236.20/194.01 [2019-03-29 02:13:58,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 236.20/194.01 [2019-03-29 02:13:58,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 236.20/194.01 [2019-03-29 02:13:58,787 INFO L133 SettingsManager]: * Rewrite not-equals=true 236.20/194.01 [2019-03-29 02:13:58,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 236.20/194.01 [2019-03-29 02:13:58,787 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 236.20/194.01 [2019-03-29 02:13:58,787 INFO L133 SettingsManager]: * Use SBE=true 236.20/194.01 [2019-03-29 02:13:58,787 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 236.20/194.01 [2019-03-29 02:13:58,787 INFO L133 SettingsManager]: * Use old map elimination=false 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 236.20/194.01 [2019-03-29 02:13:58,788 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.01 [2019-03-29 02:13:58,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 236.20/194.01 [2019-03-29 02:13:58,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 236.20/194.01 [2019-03-29 02:13:58,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE 236.20/194.01 [2019-03-29 02:13:58,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 236.20/194.01 [2019-03-29 02:13:58,789 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 236.20/194.01 [2019-03-29 02:13:58,789 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 236.20/194.01 [2019-03-29 02:13:58,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 236.20/194.01 [2019-03-29 02:13:58,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 236.20/194.01 [2019-03-29 02:13:58,790 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 236.20/194.01 [2019-03-29 02:13:58,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 236.20/194.01 [2019-03-29 02:13:58,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 236.20/194.01 [2019-03-29 02:13:58,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 236.20/194.01 [2019-03-29 02:13:58,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 236.20/194.01 [2019-03-29 02:13:58,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 236.20/194.01 [2019-03-29 02:13:58,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 236.20/194.01 [2019-03-29 02:13:58,829 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 236.20/194.01 [2019-03-29 02:13:58,833 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 236.20/194.01 [2019-03-29 02:13:58,834 INFO L271 PluginConnector]: Initializing CDTParser... 236.20/194.01 [2019-03-29 02:13:58,834 INFO L276 PluginConnector]: CDTParser initialized 236.20/194.01 [2019-03-29 02:13:58,835 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 236.20/194.01 [2019-03-29 02:13:58,904 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/bc70087232c644c4820b89fcb058bec0/FLAG755dd9290 236.20/194.01 [2019-03-29 02:13:59,249 INFO L307 CDTParser]: Found 1 translation units. 236.20/194.01 [2019-03-29 02:13:59,250 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 236.20/194.01 [2019-03-29 02:13:59,256 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/bc70087232c644c4820b89fcb058bec0/FLAG755dd9290 236.20/194.01 [2019-03-29 02:13:59,661 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/bc70087232c644c4820b89fcb058bec0 236.20/194.01 [2019-03-29 02:13:59,673 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 236.20/194.01 [2019-03-29 02:13:59,674 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 236.20/194.01 [2019-03-29 02:13:59,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 236.20/194.01 [2019-03-29 02:13:59,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 236.20/194.01 [2019-03-29 02:13:59,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 236.20/194.01 [2019-03-29 02:13:59,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308ca8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59, skipping insertion in model container 236.20/194.01 [2019-03-29 02:13:59,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 236.20/194.01 [2019-03-29 02:13:59,708 INFO L176 MainTranslator]: Built tables and reachable declarations 236.20/194.01 [2019-03-29 02:13:59,861 INFO L206 PostProcessor]: Analyzing one entry point: main 236.20/194.01 [2019-03-29 02:13:59,866 INFO L191 MainTranslator]: Completed pre-run 236.20/194.01 [2019-03-29 02:13:59,882 INFO L206 PostProcessor]: Analyzing one entry point: main 236.20/194.01 [2019-03-29 02:13:59,896 INFO L195 MainTranslator]: Completed translation 236.20/194.01 [2019-03-29 02:13:59,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59 WrapperNode 236.20/194.01 [2019-03-29 02:13:59,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 236.20/194.01 [2019-03-29 02:13:59,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 236.20/194.01 [2019-03-29 02:13:59,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 236.20/194.01 [2019-03-29 02:13:59,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 236.20/194.01 [2019-03-29 02:13:59,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 236.20/194.01 [2019-03-29 02:13:59,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 236.20/194.01 [2019-03-29 02:13:59,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 236.20/194.01 [2019-03-29 02:13:59,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized 236.20/194.01 [2019-03-29 02:13:59,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:13:59,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:14:00,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:14:00,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:14:00,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 [2019-03-29 02:14:00,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 236.20/194.01 [2019-03-29 02:14:00,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 236.20/194.01 [2019-03-29 02:14:00,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... 236.20/194.01 [2019-03-29 02:14:00,008 INFO L276 PluginConnector]: RCFGBuilder initialized 236.20/194.01 [2019-03-29 02:14:00,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (1/1) ... 236.20/194.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.01 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 236.20/194.01 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 236.20/194.01 [2019-03-29 02:14:00,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 236.20/194.01 [2019-03-29 02:14:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 236.20/194.01 [2019-03-29 02:14:00,206 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 236.20/194.01 [2019-03-29 02:14:00,207 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 236.20/194.01 [2019-03-29 02:14:00,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:14:00 BoogieIcfgContainer 236.20/194.01 [2019-03-29 02:14:00,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 236.20/194.01 [2019-03-29 02:14:00,209 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 236.20/194.01 [2019-03-29 02:14:00,209 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 236.20/194.01 [2019-03-29 02:14:00,211 INFO L276 PluginConnector]: BlockEncodingV2 initialized 236.20/194.01 [2019-03-29 02:14:00,212 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:14:00" (1/1) ... 236.20/194.01 [2019-03-29 02:14:00,227 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 236.20/194.01 [2019-03-29 02:14:00,228 INFO L258 BlockEncoder]: Using Remove infeasible edges 236.20/194.01 [2019-03-29 02:14:00,229 INFO L263 BlockEncoder]: Using Maximize final states 236.20/194.01 [2019-03-29 02:14:00,230 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 236.20/194.01 [2019-03-29 02:14:00,230 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 236.20/194.01 [2019-03-29 02:14:00,232 INFO L296 BlockEncoder]: Using Remove sink states 236.20/194.01 [2019-03-29 02:14:00,234 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 236.20/194.01 [2019-03-29 02:14:00,234 INFO L179 BlockEncoder]: Using Rewrite not-equals 236.20/194.01 [2019-03-29 02:14:00,249 INFO L185 BlockEncoder]: Using Use SBE 236.20/194.01 [2019-03-29 02:14:00,265 INFO L200 BlockEncoder]: SBE split 3 edges 236.20/194.01 [2019-03-29 02:14:00,270 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 236.20/194.01 [2019-03-29 02:14:00,272 INFO L71 MaximizeFinalStates]: 0 new accepting states 236.20/194.01 [2019-03-29 02:14:00,284 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 236.20/194.01 [2019-03-29 02:14:00,286 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 236.20/194.01 [2019-03-29 02:14:00,287 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 236.20/194.01 [2019-03-29 02:14:00,287 INFO L71 MaximizeFinalStates]: 0 new accepting states 236.20/194.01 [2019-03-29 02:14:00,288 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 236.20/194.01 [2019-03-29 02:14:00,288 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 236.20/194.01 [2019-03-29 02:14:00,288 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 236.20/194.01 [2019-03-29 02:14:00,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:14:00 BasicIcfg 236.20/194.01 [2019-03-29 02:14:00,289 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 236.20/194.01 [2019-03-29 02:14:00,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 236.20/194.01 [2019-03-29 02:14:00,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... 236.20/194.01 [2019-03-29 02:14:00,293 INFO L276 PluginConnector]: TraceAbstraction initialized 236.20/194.01 [2019-03-29 02:14:00,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 02:13:59" (1/4) ... 236.20/194.01 [2019-03-29 02:14:00,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f482970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:14:00, skipping insertion in model container 236.20/194.01 [2019-03-29 02:14:00,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (2/4) ... 236.20/194.01 [2019-03-29 02:14:00,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f482970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:14:00, skipping insertion in model container 236.20/194.01 [2019-03-29 02:14:00,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:14:00" (3/4) ... 236.20/194.01 [2019-03-29 02:14:00,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f482970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:14:00, skipping insertion in model container 236.20/194.01 [2019-03-29 02:14:00,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:14:00" (4/4) ... 236.20/194.01 [2019-03-29 02:14:00,297 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 236.20/194.01 [2019-03-29 02:14:00,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 236.20/194.01 [2019-03-29 02:14:00,314 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 236.20/194.01 [2019-03-29 02:14:00,332 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 236.20/194.01 [2019-03-29 02:14:00,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation 236.20/194.01 [2019-03-29 02:14:00,361 INFO L382 AbstractCegarLoop]: Interprodecural is true 236.20/194.01 [2019-03-29 02:14:00,361 INFO L383 AbstractCegarLoop]: Hoare is true 236.20/194.01 [2019-03-29 02:14:00,361 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 236.20/194.01 [2019-03-29 02:14:00,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 236.20/194.01 [2019-03-29 02:14:00,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 236.20/194.01 [2019-03-29 02:14:00,362 INFO L387 AbstractCegarLoop]: Difference is false 236.20/194.01 [2019-03-29 02:14:00,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 236.20/194.02 [2019-03-29 02:14:00,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 236.20/194.02 [2019-03-29 02:14:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 236.20/194.02 [2019-03-29 02:14:00,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 236.20/194.02 [2019-03-29 02:14:00,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 236.20/194.02 [2019-03-29 02:14:00,433 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 11 23) the Hoare annotation is: true 236.20/194.02 [2019-03-29 02:14:00,434 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 11 23) no Hoare annotation was computed. 236.20/194.02 [2019-03-29 02:14:00,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 236.20/194.02 [2019-03-29 02:14:00,434 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 236.20/194.02 [2019-03-29 02:14:00,434 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 23) no Hoare annotation was computed. 236.20/194.02 [2019-03-29 02:14:00,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:14:00 BasicIcfg 236.20/194.02 [2019-03-29 02:14:00,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 236.20/194.02 [2019-03-29 02:14:00,443 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 236.20/194.02 [2019-03-29 02:14:00,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 236.20/194.02 [2019-03-29 02:14:00,447 INFO L276 PluginConnector]: BuchiAutomizer initialized 236.20/194.02 [2019-03-29 02:14:00,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 236.20/194.02 [2019-03-29 02:14:00,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 02:13:59" (1/5) ... 236.20/194.02 [2019-03-29 02:14:00,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d47ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:14:00, skipping insertion in model container 236.20/194.02 [2019-03-29 02:14:00,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 236.20/194.02 [2019-03-29 02:14:00,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:13:59" (2/5) ... 236.20/194.02 [2019-03-29 02:14:00,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d47ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:14:00, skipping insertion in model container 236.20/194.02 [2019-03-29 02:14:00,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 236.20/194.02 [2019-03-29 02:14:00,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:14:00" (3/5) ... 236.20/194.02 [2019-03-29 02:14:00,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d47ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:14:00, skipping insertion in model container 236.20/194.02 [2019-03-29 02:14:00,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 236.20/194.02 [2019-03-29 02:14:00,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:14:00" (4/5) ... 236.20/194.02 [2019-03-29 02:14:00,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d47ad36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:14:00, skipping insertion in model container 236.20/194.02 [2019-03-29 02:14:00,451 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 236.20/194.02 [2019-03-29 02:14:00,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:14:00" (5/5) ... 236.20/194.02 [2019-03-29 02:14:00,453 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 236.20/194.02 [2019-03-29 02:14:00,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation 236.20/194.02 [2019-03-29 02:14:00,482 INFO L374 BuchiCegarLoop]: Interprodecural is true 236.20/194.02 [2019-03-29 02:14:00,482 INFO L375 BuchiCegarLoop]: Hoare is true 236.20/194.02 [2019-03-29 02:14:00,482 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 236.20/194.02 [2019-03-29 02:14:00,482 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 236.20/194.02 [2019-03-29 02:14:00,482 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 236.20/194.02 [2019-03-29 02:14:00,482 INFO L379 BuchiCegarLoop]: Difference is false 236.20/194.02 [2019-03-29 02:14:00,482 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 236.20/194.02 [2019-03-29 02:14:00,483 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 236.20/194.02 [2019-03-29 02:14:00,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 236.20/194.02 [2019-03-29 02:14:00,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 236.20/194.02 [2019-03-29 02:14:00,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:00,505 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:00,512 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 236.20/194.02 [2019-03-29 02:14:00,512 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:00,512 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 236.20/194.02 [2019-03-29 02:14:00,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 236.20/194.02 [2019-03-29 02:14:00,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 236.20/194.02 [2019-03-29 02:14:00,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:00,513 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:00,514 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 236.20/194.02 [2019-03-29 02:14:00,514 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:00,519 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5#L18-1true 236.20/194.02 [2019-03-29 02:14:00,519 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6#L12true [53] L12-->L12-2: Formula: (> 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3#L12-2true [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 7#L15-1true [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L18-1true 236.20/194.02 [2019-03-29 02:14:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:00,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:00,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2197058, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:00,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:00,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:00,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 236.20/194.02 [2019-03-29 02:14:00,649 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:00,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 236.20/194.02 [2019-03-29 02:14:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 236.20/194.02 [2019-03-29 02:14:00,666 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:00,703 INFO L93 Difference]: Finished difference Result 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 236.20/194.02 [2019-03-29 02:14:00,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 236.20/194.02 [2019-03-29 02:14:00,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 236.20/194.02 [2019-03-29 02:14:00,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 236.20/194.02 [2019-03-29 02:14:00,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 236.20/194.02 [2019-03-29 02:14:00,716 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 11 transitions. 236.20/194.02 [2019-03-29 02:14:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. 236.20/194.02 [2019-03-29 02:14:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 236.20/194.02 [2019-03-29 02:14:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. 236.20/194.02 [2019-03-29 02:14:00,746 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. 236.20/194.02 [2019-03-29 02:14:00,746 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. 236.20/194.02 [2019-03-29 02:14:00,747 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 236.20/194.02 [2019-03-29 02:14:00,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. 236.20/194.02 [2019-03-29 02:14:00,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 236.20/194.02 [2019-03-29 02:14:00,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:00,747 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:00,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 236.20/194.02 [2019-03-29 02:14:00,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:00,748 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 23#L18-1 236.20/194.02 [2019-03-29 02:14:00,749 INFO L796 eck$LassoCheckResult]: Loop: 23#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 24#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 21#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 23#L18-1 236.20/194.02 [2019-03-29 02:14:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times 236.20/194.02 [2019-03-29 02:14:00,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2198019, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:00,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:00,770 INFO L82 PathProgramCache]: Analyzing trace with hash 64997447, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:00,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:00,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:00,827 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:00,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:00,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:00,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:00,829 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.20/194.02 [2019-03-29 02:14:00,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:00,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:00,829 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:00,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 236.20/194.02 [2019-03-29 02:14:00,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:00,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:00,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:00,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:00,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:00,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:00,948 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:00,949 INFO L412 LassoAnalysis]: Checking for nontermination... 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:00,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:00,961 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:00,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.20/194.02 [2019-03-29 02:14:00,995 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: [] 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,005 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:01,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.20/194.02 [2019-03-29 02:14:01,037 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: [] 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,045 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:01,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.20/194.02 [2019-03-29 02:14:01,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,079 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,110 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:01,116 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.20/194.02 [2019-03-29 02:14:01,140 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:01,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:01,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:01,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:01,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.20/194.02 [2019-03-29 02:14:01,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:01,142 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:01,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 236.20/194.02 [2019-03-29 02:14:01,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:01,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:01,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,236 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:01,242 INFO L497 LassoAnalysis]: Using template 'affine'. 236.20/194.02 [2019-03-29 02:14:01,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:01,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:01,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:01,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:01,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:01,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:01,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:01,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.20/194.02 [2019-03-29 02:14:01,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:01,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:01,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:01,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:01,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:01,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:01,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:01,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.20/194.02 [2019-03-29 02:14:01,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:01,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:01,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.20/194.02 [2019-03-29 02:14:01,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:01,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:01,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:01,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:01,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:01,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.20/194.02 [2019-03-29 02:14:01,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:01,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:01,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.20/194.02 [2019-03-29 02:14:01,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:01,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:01,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:01,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:01,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:01,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.20/194.02 [2019-03-29 02:14:01,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.20/194.02 [2019-03-29 02:14:01,289 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 236.20/194.02 [2019-03-29 02:14:01,291 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.20/194.02 [2019-03-29 02:14:01,291 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.20/194.02 [2019-03-29 02:14:01,292 INFO L518 LassoAnalysis]: Proved termination. 236.20/194.02 [2019-03-29 02:14:01,292 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.20/194.02 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 236.20/194.02 Supporting invariants [] 236.20/194.02 [2019-03-29 02:14:01,293 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.20/194.02 [2019-03-29 02:14:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:01,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:01,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:01,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:01,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:01,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:01,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:01,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:01,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:01,473 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 236.20/194.02 [2019-03-29 02:14:01,476 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 5 loop predicates 236.20/194.02 [2019-03-29 02:14:01,477 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 10 transitions. cyclomatic complexity: 6 Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:01,723 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 10 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 55 states and 114 transitions. Complement of second has 16 states. 236.20/194.02 [2019-03-29 02:14:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states 236.20/194.02 [2019-03-29 02:14:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 236.20/194.02 [2019-03-29 02:14:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. 236.20/194.02 [2019-03-29 02:14:01,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 1 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:01,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:01,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 5 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:01,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:01,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 1 letters. Loop has 8 letters. 236.20/194.02 [2019-03-29 02:14:01,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:01,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 114 transitions. 236.20/194.02 [2019-03-29 02:14:01,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 236.20/194.02 [2019-03-29 02:14:01,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 43 states and 85 transitions. 236.20/194.02 [2019-03-29 02:14:01,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 236.20/194.02 [2019-03-29 02:14:01,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 236.20/194.02 [2019-03-29 02:14:01,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 85 transitions. 236.20/194.02 [2019-03-29 02:14:01,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:01,742 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 85 transitions. 236.20/194.02 [2019-03-29 02:14:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 85 transitions. 236.20/194.02 [2019-03-29 02:14:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. 236.20/194.02 [2019-03-29 02:14:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 236.20/194.02 [2019-03-29 02:14:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. 236.20/194.02 [2019-03-29 02:14:01,749 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 76 transitions. 236.20/194.02 [2019-03-29 02:14:01,749 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 76 transitions. 236.20/194.02 [2019-03-29 02:14:01,749 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 236.20/194.02 [2019-03-29 02:14:01,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 76 transitions. 236.20/194.02 [2019-03-29 02:14:01,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 236.20/194.02 [2019-03-29 02:14:01,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:01,751 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:01,752 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:01,752 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:01,753 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 168#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 180#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 194#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 190#L15-1 236.20/194.02 [2019-03-29 02:14:01,753 INFO L796 eck$LassoCheckResult]: Loop: 190#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 189#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 192#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 191#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 190#L15-1 236.20/194.02 [2019-03-29 02:14:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2096337, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:01,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:01,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:01,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 236.20/194.02 [2019-03-29 02:14:01,770 INFO L799 eck$LassoCheckResult]: stem already infeasible 236.20/194.02 [2019-03-29 02:14:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2305227, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:01,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:01,820 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:01,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:01,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:01,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:01,821 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.20/194.02 [2019-03-29 02:14:01,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:01,822 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:01,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 236.20/194.02 [2019-03-29 02:14:01,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:01,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:01,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:01,914 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:01,914 INFO L412 LassoAnalysis]: Checking for nontermination... 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:01,950 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.20/194.02 [2019-03-29 02:14:01,950 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: [] 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,956 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:01,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.20/194.02 [2019-03-29 02:14:01,985 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:01,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:01,992 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:02,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:02,024 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:02,173 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.20/194.02 [2019-03-29 02:14:02,175 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:02,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:02,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:02,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:02,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.20/194.02 [2019-03-29 02:14:02,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:02,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:02,198 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:02,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 236.20/194.02 [2019-03-29 02:14:02,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:02,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:02,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:02,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:02,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:02,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:02,277 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:02,278 INFO L497 LassoAnalysis]: Using template 'affine'. 236.20/194.02 [2019-03-29 02:14:02,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:02,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:02,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:02,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:02,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:02,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:02,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:02,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.20/194.02 [2019-03-29 02:14:02,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:02,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:02,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.20/194.02 [2019-03-29 02:14:02,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:02,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:02,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:02,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:02,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:02,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.20/194.02 [2019-03-29 02:14:02,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.20/194.02 [2019-03-29 02:14:02,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.20/194.02 [2019-03-29 02:14:02,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.20/194.02 [2019-03-29 02:14:02,298 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.20/194.02 [2019-03-29 02:14:02,298 INFO L518 LassoAnalysis]: Proved termination. 236.20/194.02 [2019-03-29 02:14:02,298 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.20/194.02 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 236.20/194.02 Supporting invariants [] 236.20/194.02 [2019-03-29 02:14:02,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.20/194.02 [2019-03-29 02:14:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:02,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:02,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:02,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:02,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:02,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:02,816 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.20/194.02 [2019-03-29 02:14:03,262 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.20/194.02 [2019-03-29 02:14:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:03,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:03,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:03,714 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 236.20/194.02 [2019-03-29 02:14:03,714 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 5 loop predicates 236.20/194.02 [2019-03-29 02:14:03,714 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 76 transitions. cyclomatic complexity: 44 Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:03,932 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 76 transitions. cyclomatic complexity: 44. Second operand 3 states. Result 605 states and 1138 transitions. Complement of second has 51 states. 236.20/194.02 [2019-03-29 02:14:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states 236.20/194.02 [2019-03-29 02:14:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 236.20/194.02 [2019-03-29 02:14:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. 236.20/194.02 [2019-03-29 02:14:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 4 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 8 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 4 letters. Loop has 8 letters. 236.20/194.02 [2019-03-29 02:14:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:03,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 1138 transitions. 236.20/194.02 [2019-03-29 02:14:03,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 119 236.20/194.02 [2019-03-29 02:14:03,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 195 states and 348 transitions. 236.20/194.02 [2019-03-29 02:14:03,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 236.20/194.02 [2019-03-29 02:14:03,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 236.20/194.02 [2019-03-29 02:14:03,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 348 transitions. 236.20/194.02 [2019-03-29 02:14:03,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:03,959 INFO L706 BuchiCegarLoop]: Abstraction has 195 states and 348 transitions. 236.20/194.02 [2019-03-29 02:14:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 348 transitions. 236.20/194.02 [2019-03-29 02:14:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. 236.20/194.02 [2019-03-29 02:14:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. 236.20/194.02 [2019-03-29 02:14:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 281 transitions. 236.20/194.02 [2019-03-29 02:14:03,974 INFO L729 BuchiCegarLoop]: Abstraction has 146 states and 281 transitions. 236.20/194.02 [2019-03-29 02:14:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 236.20/194.02 [2019-03-29 02:14:03,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 236.20/194.02 [2019-03-29 02:14:03,975 INFO L87 Difference]: Start difference. First operand 146 states and 281 transitions. Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:04,006 INFO L93 Difference]: Finished difference Result 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 236.20/194.02 [2019-03-29 02:14:04,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 236.20/194.02 [2019-03-29 02:14:04,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 236.20/194.02 [2019-03-29 02:14:04,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 236.20/194.02 [2019-03-29 02:14:04,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:04,014 INFO L706 BuchiCegarLoop]: Abstraction has 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 301 transitions. 236.20/194.02 [2019-03-29 02:14:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. 236.20/194.02 [2019-03-29 02:14:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. 236.20/194.02 [2019-03-29 02:14:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 289 transitions. 236.20/194.02 [2019-03-29 02:14:04,025 INFO L729 BuchiCegarLoop]: Abstraction has 161 states and 289 transitions. 236.20/194.02 [2019-03-29 02:14:04,025 INFO L609 BuchiCegarLoop]: Abstraction has 161 states and 289 transitions. 236.20/194.02 [2019-03-29 02:14:04,025 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 236.20/194.02 [2019-03-29 02:14:04,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 289 transitions. 236.20/194.02 [2019-03-29 02:14:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 99 236.20/194.02 [2019-03-29 02:14:04,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:04,027 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:04,027 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:04,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:04,028 INFO L794 eck$LassoCheckResult]: Stem: 1243#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1244#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1331#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1384#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1391#L15-1 236.20/194.02 [2019-03-29 02:14:04,028 INFO L796 eck$LassoCheckResult]: Loop: 1391#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1397#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1395#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1392#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1391#L15-1 236.20/194.02 [2019-03-29 02:14:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:04,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2305227, now seen corresponding path program 2 times 236.20/194.02 [2019-03-29 02:14:04,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -691623300, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:04,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:04,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:04,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:04,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:04,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 236.20/194.02 [2019-03-29 02:14:04,078 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:04,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:04,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:04,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:04,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.20/194.02 [2019-03-29 02:14:04,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:04,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:04,079 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:04,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 236.20/194.02 [2019-03-29 02:14:04,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:04,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:04,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,143 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:04,143 INFO L412 LassoAnalysis]: Checking for nontermination... 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:04,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:04,146 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:04,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:04,180 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:04,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.20/194.02 [2019-03-29 02:14:04,330 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:04,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:04,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:04,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:04,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.20/194.02 [2019-03-29 02:14:04,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:04,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:04,331 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:04,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 236.20/194.02 [2019-03-29 02:14:04,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:04,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:04,391 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:04,391 INFO L497 LassoAnalysis]: Using template 'affine'. 236.20/194.02 [2019-03-29 02:14:04,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:04,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:04,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.20/194.02 [2019-03-29 02:14:04,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:04,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:04,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:04,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:04,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:04,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.20/194.02 [2019-03-29 02:14:04,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.20/194.02 [2019-03-29 02:14:04,402 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.20/194.02 [2019-03-29 02:14:04,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.20/194.02 [2019-03-29 02:14:04,402 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.20/194.02 [2019-03-29 02:14:04,402 INFO L518 LassoAnalysis]: Proved termination. 236.20/194.02 [2019-03-29 02:14:04,403 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.20/194.02 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 236.20/194.02 Supporting invariants [] 236.20/194.02 [2019-03-29 02:14:04,403 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.20/194.02 [2019-03-29 02:14:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:04,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:04,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:04,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:04,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:04,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:04,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:04,878 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.20/194.02 [2019-03-29 02:14:05,328 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.20/194.02 [2019-03-29 02:14:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:05,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:05,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:05,778 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 236.20/194.02 [2019-03-29 02:14:05,778 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 5 loop predicates 236.20/194.02 [2019-03-29 02:14:05,778 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 161 states and 289 transitions. cyclomatic complexity: 137 Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:05,851 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 161 states and 289 transitions. cyclomatic complexity: 137. Second operand 3 states. Result 485 states and 864 transitions. Complement of second has 12 states. 236.20/194.02 [2019-03-29 02:14:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states 236.20/194.02 [2019-03-29 02:14:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 236.20/194.02 [2019-03-29 02:14:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. 236.20/194.02 [2019-03-29 02:14:05,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:05,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:05,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 8 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:05,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:05,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 4 letters. Loop has 8 letters. 236.20/194.02 [2019-03-29 02:14:05,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:05,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 864 transitions. 236.20/194.02 [2019-03-29 02:14:05,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 236.20/194.02 [2019-03-29 02:14:05,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 196 states and 336 transitions. 236.20/194.02 [2019-03-29 02:14:05,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 236.20/194.02 [2019-03-29 02:14:05,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 236.20/194.02 [2019-03-29 02:14:05,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 336 transitions. 236.20/194.02 [2019-03-29 02:14:05,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:05,866 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 336 transitions. 236.20/194.02 [2019-03-29 02:14:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 336 transitions. 236.20/194.02 [2019-03-29 02:14:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. 236.20/194.02 [2019-03-29 02:14:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. 236.20/194.02 [2019-03-29 02:14:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 263 transitions. 236.20/194.02 [2019-03-29 02:14:05,875 INFO L729 BuchiCegarLoop]: Abstraction has 145 states and 263 transitions. 236.20/194.02 [2019-03-29 02:14:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 236.20/194.02 [2019-03-29 02:14:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 236.20/194.02 [2019-03-29 02:14:05,876 INFO L87 Difference]: Start difference. First operand 145 states and 263 transitions. Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:05,898 INFO L93 Difference]: Finished difference Result 111 states and 197 transitions. 236.20/194.02 [2019-03-29 02:14:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 236.20/194.02 [2019-03-29 02:14:05,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 197 transitions. 236.20/194.02 [2019-03-29 02:14:05,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 86 236.20/194.02 [2019-03-29 02:14:05,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 108 states and 194 transitions. 236.20/194.02 [2019-03-29 02:14:05,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 236.20/194.02 [2019-03-29 02:14:05,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 236.20/194.02 [2019-03-29 02:14:05,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 194 transitions. 236.20/194.02 [2019-03-29 02:14:05,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:05,903 INFO L706 BuchiCegarLoop]: Abstraction has 108 states and 194 transitions. 236.20/194.02 [2019-03-29 02:14:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 194 transitions. 236.20/194.02 [2019-03-29 02:14:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. 236.20/194.02 [2019-03-29 02:14:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. 236.20/194.02 [2019-03-29 02:14:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 170 transitions. 236.20/194.02 [2019-03-29 02:14:05,908 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 170 transitions. 236.20/194.02 [2019-03-29 02:14:05,908 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 170 transitions. 236.20/194.02 [2019-03-29 02:14:05,908 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 236.20/194.02 [2019-03-29 02:14:05,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 170 transitions. 236.20/194.02 [2019-03-29 02:14:05,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 236.20/194.02 [2019-03-29 02:14:05,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:05,910 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:05,910 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:05,910 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:05,911 INFO L794 eck$LassoCheckResult]: Stem: 2221#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2222#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2226#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2303#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2271#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2258#L18-1 236.20/194.02 [2019-03-29 02:14:05,911 INFO L796 eck$LassoCheckResult]: Loop: 2258#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2264#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2261#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2256#L15-1 [58] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (< 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2258#L18-1 236.20/194.02 [2019-03-29 02:14:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 64986523, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:05,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:05,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:05,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2198609, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:05,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:05,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:05,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1453011733, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:05,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:05,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:05,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:05,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:05,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:05,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:05,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 236.20/194.02 [2019-03-29 02:14:06,016 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:06,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:06,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:06,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:06,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.20/194.02 [2019-03-29 02:14:06,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:06,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:06,017 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:06,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 236.20/194.02 [2019-03-29 02:14:06,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:06,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:06,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,074 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:06,074 INFO L412 LassoAnalysis]: Checking for nontermination... 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:06,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:06,079 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:06,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.20/194.02 [2019-03-29 02:14:06,109 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.20/194.02 [2019-03-29 02:14:06,138 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.20/194.02 [2019-03-29 02:14:06,140 INFO L216 LassoAnalysis]: Preferences: 236.20/194.02 [2019-03-29 02:14:06,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.20/194.02 [2019-03-29 02:14:06,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.20/194.02 [2019-03-29 02:14:06,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.20/194.02 [2019-03-29 02:14:06,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.20/194.02 [2019-03-29 02:14:06,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.20/194.02 [2019-03-29 02:14:06,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.20/194.02 [2019-03-29 02:14:06,140 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.20/194.02 [2019-03-29 02:14:06,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 236.20/194.02 [2019-03-29 02:14:06,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.20/194.02 [2019-03-29 02:14:06,141 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.20/194.02 [2019-03-29 02:14:06,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.20/194.02 [2019-03-29 02:14:06,190 INFO L300 LassoAnalysis]: Preprocessing complete. 236.20/194.02 [2019-03-29 02:14:06,191 INFO L497 LassoAnalysis]: Using template 'affine'. 236.20/194.02 [2019-03-29 02:14:06,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.20/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.20/194.02 Number of strict supporting invariants: 0 236.20/194.02 Number of non-strict supporting invariants: 1 236.20/194.02 Consider only non-deceasing supporting invariants: true 236.20/194.02 Simplify termination arguments: true 236.20/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.20/194.02 [2019-03-29 02:14:06,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.20/194.02 [2019-03-29 02:14:06,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.20/194.02 [2019-03-29 02:14:06,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.20/194.02 [2019-03-29 02:14:06,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.20/194.02 [2019-03-29 02:14:06,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.20/194.02 [2019-03-29 02:14:06,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.20/194.02 [2019-03-29 02:14:06,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.20/194.02 [2019-03-29 02:14:06,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.20/194.02 [2019-03-29 02:14:06,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.20/194.02 [2019-03-29 02:14:06,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 236.20/194.02 [2019-03-29 02:14:06,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.20/194.02 [2019-03-29 02:14:06,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.20/194.02 [2019-03-29 02:14:06,204 INFO L518 LassoAnalysis]: Proved termination. 236.20/194.02 [2019-03-29 02:14:06,204 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.20/194.02 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 236.20/194.02 Supporting invariants [] 236.20/194.02 [2019-03-29 02:14:06,205 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.20/194.02 [2019-03-29 02:14:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,342 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 236.20/194.02 [2019-03-29 02:14:06,343 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 5 loop predicates 236.20/194.02 [2019-03-29 02:14:06,343 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 92 states and 170 transitions. cyclomatic complexity: 82 Second operand 3 states. 236.20/194.02 [2019-03-29 02:14:06,603 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 92 states and 170 transitions. cyclomatic complexity: 82. Second operand 3 states. Result 1973 states and 2985 transitions. Complement of second has 146 states. 236.20/194.02 [2019-03-29 02:14:06,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states 236.20/194.02 [2019-03-29 02:14:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 236.20/194.02 [2019-03-29 02:14:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. 236.20/194.02 [2019-03-29 02:14:06,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:06,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:06,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 9 letters. Loop has 4 letters. 236.20/194.02 [2019-03-29 02:14:06,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:06,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 8 letters. 236.20/194.02 [2019-03-29 02:14:06,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.20/194.02 [2019-03-29 02:14:06,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1973 states and 2985 transitions. 236.20/194.02 [2019-03-29 02:14:06,624 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 418 236.20/194.02 [2019-03-29 02:14:06,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1973 states to 520 states and 802 transitions. 236.20/194.02 [2019-03-29 02:14:06,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 236.20/194.02 [2019-03-29 02:14:06,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 236.20/194.02 [2019-03-29 02:14:06,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 520 states and 802 transitions. 236.20/194.02 [2019-03-29 02:14:06,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:06,629 INFO L706 BuchiCegarLoop]: Abstraction has 520 states and 802 transitions. 236.20/194.02 [2019-03-29 02:14:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 802 transitions. 236.20/194.02 [2019-03-29 02:14:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 89. 236.20/194.02 [2019-03-29 02:14:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 236.20/194.02 [2019-03-29 02:14:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 154 transitions. 236.20/194.02 [2019-03-29 02:14:06,636 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 154 transitions. 236.20/194.02 [2019-03-29 02:14:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 236.20/194.02 [2019-03-29 02:14:06,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 236.20/194.02 [2019-03-29 02:14:06,637 INFO L87 Difference]: Start difference. First operand 89 states and 154 transitions. Second operand 5 states. 236.20/194.02 [2019-03-29 02:14:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:06,690 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. 236.20/194.02 [2019-03-29 02:14:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 236.20/194.02 [2019-03-29 02:14:06,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 116 transitions. 236.20/194.02 [2019-03-29 02:14:06,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 236.20/194.02 [2019-03-29 02:14:06,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 71 states and 104 transitions. 236.20/194.02 [2019-03-29 02:14:06,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 236.20/194.02 [2019-03-29 02:14:06,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 236.20/194.02 [2019-03-29 02:14:06,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 104 transitions. 236.20/194.02 [2019-03-29 02:14:06,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:06,694 INFO L706 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. 236.20/194.02 [2019-03-29 02:14:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 104 transitions. 236.20/194.02 [2019-03-29 02:14:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. 236.20/194.02 [2019-03-29 02:14:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 236.20/194.02 [2019-03-29 02:14:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. 236.20/194.02 [2019-03-29 02:14:06,696 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 86 transitions. 236.20/194.02 [2019-03-29 02:14:06,696 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 86 transitions. 236.20/194.02 [2019-03-29 02:14:06,696 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 236.20/194.02 [2019-03-29 02:14:06,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 86 transitions. 236.20/194.02 [2019-03-29 02:14:06,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 236.20/194.02 [2019-03-29 02:14:06,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:06,697 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:06,698 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 236.20/194.02 [2019-03-29 02:14:06,698 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 5, 5, 2, 2, 2] 236.20/194.02 [2019-03-29 02:14:06,698 INFO L794 eck$LassoCheckResult]: Stem: 4714#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4715#L18-1 236.20/194.02 [2019-03-29 02:14:06,699 INFO L796 eck$LassoCheckResult]: Loop: 4715#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4717#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4710#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4711#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4761#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4760#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4753#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4752#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4750#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4747#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4744#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4746#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4745#L12-2 [55] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4731#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4743#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4742#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4740#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4739#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4738#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4737#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4741#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4726#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4728#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4734#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4729#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4732#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4715#L18-1 236.20/194.02 [2019-03-29 02:14:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times 236.20/194.02 [2019-03-29 02:14:06,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1582217713, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:06,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:06,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 236.20/194.02 [2019-03-29 02:14:06,731 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 236.20/194.02 [2019-03-29 02:14:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 236.20/194.02 [2019-03-29 02:14:06,732 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. cyclomatic complexity: 31 Second operand 4 states. 236.20/194.02 [2019-03-29 02:14:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:06,771 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 236.20/194.02 [2019-03-29 02:14:06,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 236.20/194.02 [2019-03-29 02:14:06,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 236.20/194.02 [2019-03-29 02:14:06,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 236.20/194.02 [2019-03-29 02:14:06,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:06,775 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. 236.20/194.02 [2019-03-29 02:14:06,776 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 236.20/194.02 [2019-03-29 02:14:06,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 39 transitions. 236.20/194.02 [2019-03-29 02:14:06,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 236.20/194.02 [2019-03-29 02:14:06,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:06,777 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:06,778 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.20/194.02 [2019-03-29 02:14:06,778 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:06,778 INFO L794 eck$LassoCheckResult]: Stem: 4808#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4809#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4811#L12 236.20/194.02 [2019-03-29 02:14:06,778 INFO L796 eck$LassoCheckResult]: Loop: 4811#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4804#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4805#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4816#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4821#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4815#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4817#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4818#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4811#L12 236.20/194.02 [2019-03-29 02:14:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:06,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2135425347, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:06,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:06,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:06,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 236.20/194.02 [2019-03-29 02:14:06,859 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 236.20/194.02 [2019-03-29 02:14:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 236.20/194.02 [2019-03-29 02:14:06,859 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. cyclomatic complexity: 16 Second operand 4 states. 236.20/194.02 [2019-03-29 02:14:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:06,880 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. 236.20/194.02 [2019-03-29 02:14:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 236.20/194.02 [2019-03-29 02:14:06,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. 236.20/194.02 [2019-03-29 02:14:06,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 236.20/194.02 [2019-03-29 02:14:06,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 236.20/194.02 [2019-03-29 02:14:06,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 236.20/194.02 [2019-03-29 02:14:06,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:06,883 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 236.20/194.02 [2019-03-29 02:14:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 236.20/194.02 [2019-03-29 02:14:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,885 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,885 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,885 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 236.20/194.02 [2019-03-29 02:14:06,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. 236.20/194.02 [2019-03-29 02:14:06,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 236.20/194.02 [2019-03-29 02:14:06,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:06,886 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:06,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.20/194.02 [2019-03-29 02:14:06,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:06,887 INFO L794 eck$LassoCheckResult]: Stem: 4885#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4886#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4890#L12 236.20/194.02 [2019-03-29 02:14:06,887 INFO L796 eck$LassoCheckResult]: Loop: 4890#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4892#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4900#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4887#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4888#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4881#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4882#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4893#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4899#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4896#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4884#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4889#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4890#L12 236.20/194.02 [2019-03-29 02:14:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 2 times 236.20/194.02 [2019-03-29 02:14:06,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1049578247, now seen corresponding path program 1 times 236.20/194.02 [2019-03-29 02:14:06,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:06,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:06,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:06,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:06,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:06,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 236.20/194.02 [2019-03-29 02:14:06,969 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 236.20/194.02 [2019-03-29 02:14:06,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 236.20/194.02 [2019-03-29 02:14:06,970 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. 236.20/194.02 [2019-03-29 02:14:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:07,012 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. 236.20/194.02 [2019-03-29 02:14:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 236.20/194.02 [2019-03-29 02:14:07,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. 236.20/194.02 [2019-03-29 02:14:07,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 236.20/194.02 [2019-03-29 02:14:07,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 36 transitions. 236.20/194.02 [2019-03-29 02:14:07,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 236.20/194.02 [2019-03-29 02:14:07,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 236.20/194.02 [2019-03-29 02:14:07,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. 236.20/194.02 [2019-03-29 02:14:07,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:07,015 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. 236.20/194.02 [2019-03-29 02:14:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. 236.20/194.02 [2019-03-29 02:14:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. 236.20/194.02 [2019-03-29 02:14:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 236.20/194.02 [2019-03-29 02:14:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. 236.20/194.02 [2019-03-29 02:14:07,017 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 236.20/194.02 [2019-03-29 02:14:07,017 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 236.20/194.02 [2019-03-29 02:14:07,017 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 236.20/194.02 [2019-03-29 02:14:07,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. 236.20/194.02 [2019-03-29 02:14:07,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 236.20/194.02 [2019-03-29 02:14:07,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:07,018 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:07,018 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.20/194.02 [2019-03-29 02:14:07,018 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:07,018 INFO L794 eck$LassoCheckResult]: Stem: 4975#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4976#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4980#L12 236.20/194.02 [2019-03-29 02:14:07,019 INFO L796 eck$LassoCheckResult]: Loop: 4980#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4982#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4994#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4993#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4992#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4991#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4985#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4977#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4978#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4971#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4972#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4990#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4983#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 4984#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4974#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4979#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4980#L12 236.20/194.02 [2019-03-29 02:14:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 3 times 236.20/194.02 [2019-03-29 02:14:07,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1913650331, now seen corresponding path program 2 times 236.20/194.02 [2019-03-29 02:14:07,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:07,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:07,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 236.20/194.02 [2019-03-29 02:14:07,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 236.20/194.02 [2019-03-29 02:14:07,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:07,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 236.20/194.02 [2019-03-29 02:14:07,123 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 236.20/194.02 [2019-03-29 02:14:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 236.20/194.02 [2019-03-29 02:14:07,124 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. cyclomatic complexity: 10 Second operand 6 states. 236.20/194.02 [2019-03-29 02:14:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:07,175 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. 236.20/194.02 [2019-03-29 02:14:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 236.20/194.02 [2019-03-29 02:14:07,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. 236.20/194.02 [2019-03-29 02:14:07,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 236.20/194.02 [2019-03-29 02:14:07,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 41 transitions. 236.20/194.02 [2019-03-29 02:14:07,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 236.20/194.02 [2019-03-29 02:14:07,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 236.20/194.02 [2019-03-29 02:14:07,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. 236.20/194.02 [2019-03-29 02:14:07,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:07,179 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. 236.20/194.02 [2019-03-29 02:14:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. 236.20/194.02 [2019-03-29 02:14:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. 236.20/194.02 [2019-03-29 02:14:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 236.20/194.02 [2019-03-29 02:14:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. 236.20/194.02 [2019-03-29 02:14:07,180 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. 236.20/194.02 [2019-03-29 02:14:07,180 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. 236.20/194.02 [2019-03-29 02:14:07,181 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 236.20/194.02 [2019-03-29 02:14:07,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. 236.20/194.02 [2019-03-29 02:14:07,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 236.20/194.02 [2019-03-29 02:14:07,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:07,181 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:07,182 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.20/194.02 [2019-03-29 02:14:07,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:07,182 INFO L794 eck$LassoCheckResult]: Stem: 5086#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5087#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5091#L12 236.20/194.02 [2019-03-29 02:14:07,183 INFO L796 eck$LassoCheckResult]: Loop: 5091#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5082#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5083#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5088#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5089#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5109#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5108#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5107#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5106#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5105#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5104#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5103#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5100#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5102#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5101#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5099#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5093#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5094#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5085#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5090#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5091#L12 236.20/194.02 [2019-03-29 02:14:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 4 times 236.20/194.02 [2019-03-29 02:14:07,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1398889667, now seen corresponding path program 3 times 236.20/194.02 [2019-03-29 02:14:07,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:07,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:07,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 236.20/194.02 [2019-03-29 02:14:07,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) 236.20/194.02 [2019-03-29 02:14:07,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:07,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:07,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 236.20/194.02 [2019-03-29 02:14:07,309 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 236.20/194.02 [2019-03-29 02:14:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 236.20/194.02 [2019-03-29 02:14:07,309 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 11 Second operand 7 states. 236.20/194.02 [2019-03-29 02:14:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:07,364 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. 236.20/194.02 [2019-03-29 02:14:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 236.20/194.02 [2019-03-29 02:14:07,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. 236.20/194.02 [2019-03-29 02:14:07,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 236.20/194.02 [2019-03-29 02:14:07,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 46 transitions. 236.20/194.02 [2019-03-29 02:14:07,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 236.20/194.02 [2019-03-29 02:14:07,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 236.20/194.02 [2019-03-29 02:14:07,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. 236.20/194.02 [2019-03-29 02:14:07,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:07,368 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. 236.20/194.02 [2019-03-29 02:14:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. 236.20/194.02 [2019-03-29 02:14:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. 236.20/194.02 [2019-03-29 02:14:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 236.20/194.02 [2019-03-29 02:14:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. 236.20/194.02 [2019-03-29 02:14:07,370 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. 236.20/194.02 [2019-03-29 02:14:07,370 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. 236.20/194.02 [2019-03-29 02:14:07,370 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 236.20/194.02 [2019-03-29 02:14:07,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. 236.20/194.02 [2019-03-29 02:14:07,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 236.20/194.02 [2019-03-29 02:14:07,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.20/194.02 [2019-03-29 02:14:07,371 INFO L119 BuchiIsEmpty]: Starting construction of run 236.20/194.02 [2019-03-29 02:14:07,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.20/194.02 [2019-03-29 02:14:07,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] 236.20/194.02 [2019-03-29 02:14:07,372 INFO L794 eck$LassoCheckResult]: Stem: 5218#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5219#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5223#L12 236.20/194.02 [2019-03-29 02:14:07,373 INFO L796 eck$LassoCheckResult]: Loop: 5223#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5214#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5215#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5220#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5221#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5245#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5244#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5243#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5242#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5241#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5240#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5239#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5238#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5237#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5236#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5235#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5232#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5234#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5233#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5231#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5225#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5226#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5217#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5222#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5223#L12 236.20/194.02 [2019-03-29 02:14:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 5 times 236.20/194.02 [2019-03-29 02:14:07,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.20/194.02 [2019-03-29 02:14:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.20/194.02 [2019-03-29 02:14:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash -475343071, now seen corresponding path program 4 times 236.20/194.02 [2019-03-29 02:14:07,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.20/194.02 [2019-03-29 02:14:07,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.20/194.02 [2019-03-29 02:14:07,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.20/194.02 [2019-03-29 02:14:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.20/194.02 [2019-03-29 02:14:07,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.20/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.20/194.02 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.20/194.02 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.20/194.02 [2019-03-29 02:14:07,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 236.20/194.02 [2019-03-29 02:14:07,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 236.20/194.02 [2019-03-29 02:14:07,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.20/194.02 [2019-03-29 02:14:07,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core 236.20/194.02 [2019-03-29 02:14:07,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.20/194.02 [2019-03-29 02:14:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.20/194.02 [2019-03-29 02:14:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.20/194.02 [2019-03-29 02:14:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 236.20/194.02 [2019-03-29 02:14:07,517 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.20/194.02 [2019-03-29 02:14:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 236.20/194.02 [2019-03-29 02:14:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 236.20/194.02 [2019-03-29 02:14:07,517 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 8 states. 236.20/194.02 [2019-03-29 02:14:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.20/194.02 [2019-03-29 02:14:07,576 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. 236.20/194.02 [2019-03-29 02:14:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 236.20/194.02 [2019-03-29 02:14:07,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. 236.20/194.02 [2019-03-29 02:14:07,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 236.20/194.02 [2019-03-29 02:14:07,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 51 transitions. 236.20/194.02 [2019-03-29 02:14:07,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 236.20/194.02 [2019-03-29 02:14:07,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 236.20/194.02 [2019-03-29 02:14:07,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. 236.20/194.02 [2019-03-29 02:14:07,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.20/194.02 [2019-03-29 02:14:07,580 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. 236.20/194.02 [2019-03-29 02:14:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. 236.20/194.02 [2019-03-29 02:14:07,581 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 236.20/194.02 [2019-03-29 02:14:07,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. 236.26/194.02 [2019-03-29 02:14:07,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 236.26/194.02 [2019-03-29 02:14:07,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.02 [2019-03-29 02:14:07,582 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.02 [2019-03-29 02:14:07,583 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.26/194.02 [2019-03-29 02:14:07,583 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] 236.26/194.02 [2019-03-29 02:14:07,583 INFO L794 eck$LassoCheckResult]: Stem: 5371#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5372#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5376#L12 236.26/194.02 [2019-03-29 02:14:07,584 INFO L796 eck$LassoCheckResult]: Loop: 5376#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5367#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5368#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5373#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5374#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5402#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5401#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5400#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5399#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5398#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5397#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5396#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5395#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5394#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5393#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5392#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5391#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5390#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5389#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5388#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5385#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5387#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5386#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5384#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5378#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5379#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5370#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5375#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5376#L12 236.26/194.02 [2019-03-29 02:14:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:07,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 6 times 236.26/194.02 [2019-03-29 02:14:07,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -472649089, now seen corresponding path program 5 times 236.26/194.02 [2019-03-29 02:14:07,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:07,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.02 [2019-03-29 02:14:07,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.02 [2019-03-29 02:14:07,678 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 236.26/194.02 [2019-03-29 02:14:07,698 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) 236.26/194.02 [2019-03-29 02:14:07,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:07,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:07,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.02 [2019-03-29 02:14:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 236.26/194.02 [2019-03-29 02:14:07,737 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.26/194.02 [2019-03-29 02:14:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 236.26/194.02 [2019-03-29 02:14:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 236.26/194.02 [2019-03-29 02:14:07,737 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 13 Second operand 9 states. 236.26/194.02 [2019-03-29 02:14:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.02 [2019-03-29 02:14:07,806 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. 236.26/194.02 [2019-03-29 02:14:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 236.26/194.02 [2019-03-29 02:14:07,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. 236.26/194.02 [2019-03-29 02:14:07,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 236.26/194.02 [2019-03-29 02:14:07,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. 236.26/194.02 [2019-03-29 02:14:07,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 236.26/194.02 [2019-03-29 02:14:07,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 236.26/194.02 [2019-03-29 02:14:07,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. 236.26/194.02 [2019-03-29 02:14:07,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.02 [2019-03-29 02:14:07,809 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. 236.26/194.02 [2019-03-29 02:14:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. 236.26/194.02 [2019-03-29 02:14:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. 236.26/194.02 [2019-03-29 02:14:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 236.26/194.02 [2019-03-29 02:14:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. 236.26/194.02 [2019-03-29 02:14:07,811 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. 236.26/194.02 [2019-03-29 02:14:07,811 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. 236.26/194.02 [2019-03-29 02:14:07,811 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 236.26/194.02 [2019-03-29 02:14:07,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. 236.26/194.02 [2019-03-29 02:14:07,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 236.26/194.02 [2019-03-29 02:14:07,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.02 [2019-03-29 02:14:07,812 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.02 [2019-03-29 02:14:07,813 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.26/194.02 [2019-03-29 02:14:07,813 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] 236.26/194.02 [2019-03-29 02:14:07,813 INFO L794 eck$LassoCheckResult]: Stem: 5545#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5546#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5550#L12 236.26/194.02 [2019-03-29 02:14:07,814 INFO L796 eck$LassoCheckResult]: Loop: 5550#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5541#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5542#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5547#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5548#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5580#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5579#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5578#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5577#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5576#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5575#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5574#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5573#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5572#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5571#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5570#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5569#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5568#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5567#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5566#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5565#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5564#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5563#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5562#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5559#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5561#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5560#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5558#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5552#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5553#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5544#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5549#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5550#L12 236.26/194.02 [2019-03-29 02:14:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 7 times 236.26/194.02 [2019-03-29 02:14:07,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:07,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash 690237149, now seen corresponding path program 6 times 236.26/194.02 [2019-03-29 02:14:07,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:07,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:07,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.02 [2019-03-29 02:14:07,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.02 [2019-03-29 02:14:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 236.26/194.02 [2019-03-29 02:14:07,928 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) 236.26/194.02 [2019-03-29 02:14:07,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:07,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:07,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:07,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.02 [2019-03-29 02:14:07,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 236.26/194.02 [2019-03-29 02:14:07,965 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.26/194.02 [2019-03-29 02:14:07,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 236.26/194.02 [2019-03-29 02:14:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 236.26/194.02 [2019-03-29 02:14:07,965 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 14 Second operand 10 states. 236.26/194.02 [2019-03-29 02:14:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.02 [2019-03-29 02:14:08,072 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. 236.26/194.02 [2019-03-29 02:14:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 236.26/194.02 [2019-03-29 02:14:08,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. 236.26/194.02 [2019-03-29 02:14:08,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 236.26/194.02 [2019-03-29 02:14:08,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 61 transitions. 236.26/194.02 [2019-03-29 02:14:08,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 236.26/194.02 [2019-03-29 02:14:08,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 236.26/194.02 [2019-03-29 02:14:08,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. 236.26/194.02 [2019-03-29 02:14:08,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.02 [2019-03-29 02:14:08,076 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. 236.26/194.02 [2019-03-29 02:14:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. 236.26/194.02 [2019-03-29 02:14:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. 236.26/194.02 [2019-03-29 02:14:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 236.26/194.02 [2019-03-29 02:14:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. 236.26/194.02 [2019-03-29 02:14:08,078 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. 236.26/194.02 [2019-03-29 02:14:08,078 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. 236.26/194.02 [2019-03-29 02:14:08,078 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 236.26/194.02 [2019-03-29 02:14:08,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. 236.26/194.02 [2019-03-29 02:14:08,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 236.26/194.02 [2019-03-29 02:14:08,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.02 [2019-03-29 02:14:08,079 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.02 [2019-03-29 02:14:08,080 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.26/194.02 [2019-03-29 02:14:08,080 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] 236.26/194.02 [2019-03-29 02:14:08,080 INFO L794 eck$LassoCheckResult]: Stem: 5740#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5741#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5745#L12 236.26/194.02 [2019-03-29 02:14:08,081 INFO L796 eck$LassoCheckResult]: Loop: 5745#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5736#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5737#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5742#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5743#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5779#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5778#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5777#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5776#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5775#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5774#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5773#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5772#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5771#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5770#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5769#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5768#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5767#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5766#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5765#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5764#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5763#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5762#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5761#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5760#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5759#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5758#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5757#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5754#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5753#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5747#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 5748#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5739#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5744#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5745#L12 236.26/194.02 [2019-03-29 02:14:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 8 times 236.26/194.02 [2019-03-29 02:14:08,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:08,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:08,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1725756357, now seen corresponding path program 7 times 236.26/194.02 [2019-03-29 02:14:08,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:08,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:08,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.02 [2019-03-29 02:14:08,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.02 [2019-03-29 02:14:08,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:08,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.02 [2019-03-29 02:14:08,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 236.26/194.02 [2019-03-29 02:14:08,246 INFO L811 eck$LassoCheckResult]: loop already infeasible 236.26/194.02 [2019-03-29 02:14:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 236.26/194.02 [2019-03-29 02:14:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 236.26/194.02 [2019-03-29 02:14:08,246 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. cyclomatic complexity: 15 Second operand 11 states. 236.26/194.02 [2019-03-29 02:14:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.02 [2019-03-29 02:14:08,353 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. 236.26/194.02 [2019-03-29 02:14:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 236.26/194.02 [2019-03-29 02:14:08,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. 236.26/194.02 [2019-03-29 02:14:08,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 236.26/194.02 [2019-03-29 02:14:08,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 88 states and 110 transitions. 236.26/194.02 [2019-03-29 02:14:08,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 236.26/194.02 [2019-03-29 02:14:08,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 236.26/194.02 [2019-03-29 02:14:08,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 110 transitions. 236.26/194.02 [2019-03-29 02:14:08,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.02 [2019-03-29 02:14:08,357 INFO L706 BuchiCegarLoop]: Abstraction has 88 states and 110 transitions. 236.26/194.02 [2019-03-29 02:14:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 110 transitions. 236.26/194.02 [2019-03-29 02:14:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. 236.26/194.02 [2019-03-29 02:14:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. 236.26/194.02 [2019-03-29 02:14:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:08,360 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:08,360 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:08,360 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 236.26/194.02 [2019-03-29 02:14:08,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:08,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 236.26/194.02 [2019-03-29 02:14:08,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.02 [2019-03-29 02:14:08,361 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.02 [2019-03-29 02:14:08,361 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 236.26/194.02 [2019-03-29 02:14:08,361 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] 236.26/194.02 [2019-03-29 02:14:08,362 INFO L794 eck$LassoCheckResult]: Stem: 5995#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5996#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5998#L12 236.26/194.02 [2019-03-29 02:14:08,362 INFO L796 eck$LassoCheckResult]: Loop: 5998#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 6009#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6039#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6038#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6037#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6036#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6035#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6034#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6033#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6032#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6031#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6030#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6029#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6028#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6027#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6025#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6024#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6023#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6022#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6021#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6020#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6019#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6018#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6017#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6016#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6015#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6014#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6013#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6012#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6011#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6010#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6006#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6008#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 6007#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6005#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6004#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6003#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5993#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6067#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5998#L12 236.26/194.02 [2019-03-29 02:14:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 9 times 236.26/194.02 [2019-03-29 02:14:08,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 160959129, now seen corresponding path program 8 times 236.26/194.02 [2019-03-29 02:14:08,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 15078428, now seen corresponding path program 1 times 236.26/194.02 [2019-03-29 02:14:08,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:08,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:08,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:08,526 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 236.26/194.02 [2019-03-29 02:14:08,535 INFO L216 LassoAnalysis]: Preferences: 236.26/194.02 [2019-03-29 02:14:08,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.02 [2019-03-29 02:14:08,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.02 [2019-03-29 02:14:08,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.02 [2019-03-29 02:14:08,535 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.02 [2019-03-29 02:14:08,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.02 [2019-03-29 02:14:08,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.02 [2019-03-29 02:14:08,536 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.02 [2019-03-29 02:14:08,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop 236.26/194.02 [2019-03-29 02:14:08,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.02 [2019-03-29 02:14:08,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.02 [2019-03-29 02:14:08,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,594 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.02 [2019-03-29 02:14:08,594 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.02 [2019-03-29 02:14:08,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.02 [2019-03-29 02:14:08,597 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.02 [2019-03-29 02:14:08,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.02 [2019-03-29 02:14:08,627 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.02 [2019-03-29 02:14:08,659 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.02 [2019-03-29 02:14:08,660 INFO L216 LassoAnalysis]: Preferences: 236.26/194.02 [2019-03-29 02:14:08,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.02 [2019-03-29 02:14:08,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.02 [2019-03-29 02:14:08,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.02 [2019-03-29 02:14:08,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.02 [2019-03-29 02:14:08,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.02 [2019-03-29 02:14:08,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.02 [2019-03-29 02:14:08,661 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.02 [2019-03-29 02:14:08,661 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop 236.26/194.02 [2019-03-29 02:14:08,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.02 [2019-03-29 02:14:08,661 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.02 [2019-03-29 02:14:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.02 [2019-03-29 02:14:08,721 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.02 [2019-03-29 02:14:08,721 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.02 [2019-03-29 02:14:08,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.02 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.02 Number of strict supporting invariants: 0 236.26/194.02 Number of non-strict supporting invariants: 1 236.26/194.02 Consider only non-deceasing supporting invariants: true 236.26/194.02 Simplify termination arguments: true 236.26/194.02 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.02 [2019-03-29 02:14:08,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.02 [2019-03-29 02:14:08,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.02 [2019-03-29 02:14:08,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.02 [2019-03-29 02:14:08,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.02 [2019-03-29 02:14:08,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.02 [2019-03-29 02:14:08,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.02 [2019-03-29 02:14:08,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.02 [2019-03-29 02:14:08,726 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.02 [2019-03-29 02:14:08,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.02 [2019-03-29 02:14:08,728 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.02 [2019-03-29 02:14:08,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.02 [2019-03-29 02:14:08,728 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.02 [2019-03-29 02:14:08,729 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.02 [2019-03-29 02:14:08,729 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.02 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 5 236.26/194.02 Supporting invariants [] 236.26/194.02 [2019-03-29 02:14:08,729 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.02 [2019-03-29 02:14:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:08,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,574 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 8 predicates after loop cannibalization 236.26/194.02 [2019-03-29 02:14:09,574 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 236.26/194.02 [2019-03-29 02:14:09,574 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 78 states and 99 transitions. cyclomatic complexity: 23 Second operand 5 states. 236.26/194.02 [2019-03-29 02:14:09,772 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 78 states and 99 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 1099 states and 1322 transitions. Complement of second has 229 states. 236.26/194.02 [2019-03-29 02:14:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 1 accepting loop states 236.26/194.02 [2019-03-29 02:14:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 236.26/194.02 [2019-03-29 02:14:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. 236.26/194.02 [2019-03-29 02:14:09,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 2 letters. Loop has 40 letters. 236.26/194.02 [2019-03-29 02:14:09,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.02 [2019-03-29 02:14:09,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 42 letters. Loop has 40 letters. 236.26/194.02 [2019-03-29 02:14:09,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.02 [2019-03-29 02:14:09,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 66 transitions. Stem has 2 letters. Loop has 80 letters. 236.26/194.02 [2019-03-29 02:14:09,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.02 [2019-03-29 02:14:09,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1099 states and 1322 transitions. 236.26/194.02 [2019-03-29 02:14:09,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 142 236.26/194.02 [2019-03-29 02:14:09,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1099 states to 258 states and 301 transitions. 236.26/194.02 [2019-03-29 02:14:09,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 236.26/194.02 [2019-03-29 02:14:09,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 236.26/194.02 [2019-03-29 02:14:09,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 301 transitions. 236.26/194.02 [2019-03-29 02:14:09,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.02 [2019-03-29 02:14:09,789 INFO L706 BuchiCegarLoop]: Abstraction has 258 states and 301 transitions. 236.26/194.02 [2019-03-29 02:14:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 301 transitions. 236.26/194.02 [2019-03-29 02:14:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 85. 236.26/194.02 [2019-03-29 02:14:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. 236.26/194.02 [2019-03-29 02:14:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:09,792 INFO L729 BuchiCegarLoop]: Abstraction has 85 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:09,793 INFO L609 BuchiCegarLoop]: Abstraction has 85 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:09,793 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 236.26/194.02 [2019-03-29 02:14:09,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 99 transitions. 236.26/194.02 [2019-03-29 02:14:09,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.02 [2019-03-29 02:14:09,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.02 [2019-03-29 02:14:09,794 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.02 [2019-03-29 02:14:09,794 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.02 [2019-03-29 02:14:09,794 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] 236.26/194.02 [2019-03-29 02:14:09,794 INFO L794 eck$LassoCheckResult]: Stem: 12010#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 12011#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12022#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12027#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12024#L15-1 236.26/194.02 [2019-03-29 02:14:09,795 INFO L796 eck$LassoCheckResult]: Loop: 12024#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12025#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12089#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12017#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12090#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12018#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12019#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12065#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12064#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12063#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12006#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12007#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12062#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12059#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12058#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12057#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12056#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12055#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12054#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12053#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12052#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12051#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12050#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12049#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12048#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12047#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12046#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12045#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12044#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12043#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12042#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12041#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12040#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12039#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12038#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12037#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12034#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12036#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 12035#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12033#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 12032#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 12030#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 12024#L15-1 236.26/194.02 [2019-03-29 02:14:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 2 times 236.26/194.02 [2019-03-29 02:14:09,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:09,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1231542293, now seen corresponding path program 9 times 236.26/194.02 [2019-03-29 02:14:09,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:09,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:09,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.02 [2019-03-29 02:14:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.02 [2019-03-29 02:14:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1576558748, now seen corresponding path program 2 times 236.26/194.02 [2019-03-29 02:14:09,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.02 [2019-03-29 02:14:09,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.02 [2019-03-29 02:14:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.02 [2019-03-29 02:14:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:09,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.02 [2019-03-29 02:14:09,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.02 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.02 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.02 [2019-03-29 02:14:09,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 236.26/194.02 [2019-03-29 02:14:09,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 236.26/194.02 [2019-03-29 02:14:09,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.02 [2019-03-29 02:14:09,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.02 [2019-03-29 02:14:09,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.02 [2019-03-29 02:14:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.02 [2019-03-29 02:14:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.02 [2019-03-29 02:14:09,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 236.26/194.02 [2019-03-29 02:14:10,089 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 236.26/194.02 [2019-03-29 02:14:10,099 INFO L216 LassoAnalysis]: Preferences: 236.26/194.02 [2019-03-29 02:14:10,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.02 [2019-03-29 02:14:10,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.02 [2019-03-29 02:14:10,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.02 [2019-03-29 02:14:10,099 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.02 [2019-03-29 02:14:10,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.02 [2019-03-29 02:14:10,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.02 [2019-03-29 02:14:10,100 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.02 [2019-03-29 02:14:10,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 236.26/194.03 [2019-03-29 02:14:10,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:10,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:10,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,166 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:10,166 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:10,174 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:10,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:10,203 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: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:10,213 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:10,241 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:10,242 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: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:10,247 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:10,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:10,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:10,281 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:10,314 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:10,319 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.03 [2019-03-29 02:14:10,344 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:14:10,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:14:10,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:14:10,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:14:10,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.03 [2019-03-29 02:14:10,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:10,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:14:10,345 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:14:10,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 236.26/194.03 [2019-03-29 02:14:10,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:10,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:10,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:10,413 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:10,413 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.03 [2019-03-29 02:14:10,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:10,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:10,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:10,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:10,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:10,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:10,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:10,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:10,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:10,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:10,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:14:10,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:10,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:10,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:10,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:10,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:10,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:10,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:10,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:10,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:10,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:10,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:10,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:10,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:10,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:10,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:10,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:10,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:14:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:10,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:10,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:10,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:10,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:10,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.03 [2019-03-29 02:14:10,431 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.03 [2019-03-29 02:14:10,431 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.03 [2019-03-29 02:14:10,431 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.03 [2019-03-29 02:14:10,431 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.03 [2019-03-29 02:14:10,431 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.03 [2019-03-29 02:14:10,432 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.03 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 236.26/194.03 Supporting invariants [] 236.26/194.03 [2019-03-29 02:14:10,432 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.03 [2019-03-29 02:14:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:10,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:10,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:11,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:11,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:11,513 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 13 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.26/194.03 [2019-03-29 02:14:12,418 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:13,737 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:15,488 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:15,921 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int)) (<= 13 (+ (* 2 v_prenex_3) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:15,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:16,367 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_153 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_153) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:16,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:16,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:17,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:17,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:17,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:17,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:18,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:18,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:18,757 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_162 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_162) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:19,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:19,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:19,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:19,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:20,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:20,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:20,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:20,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:21,105 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_171 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_171)))) is different from true 236.26/194.03 [2019-03-29 02:14:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:21,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:21,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:22,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:22,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:22,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:22,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:23,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:23,449 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_180 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_180) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:23,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:23,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:24,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:24,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:24,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:24,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:25,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:25,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:25,793 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_189 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_189) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:26,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:26,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:26,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:27,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:27,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:27,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:27,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:28,124 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_198 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_198) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:28,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:29,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:29,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:29,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:29,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:30,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:30,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:30,436 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_207 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_207) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:30,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:30,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:31,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:31,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:31,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:31,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:32,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:32,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:32,782 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_216 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_216)))) is different from true 236.26/194.03 [2019-03-29 02:14:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:33,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:33,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:33,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:34,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:34,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:34,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:34,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:35,094 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_225 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_225)))) is different from true 236.26/194.03 [2019-03-29 02:14:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:35,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:35,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:35,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:35,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:35,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:35,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:35,709 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 23 predicates after loop cannibalization 236.26/194.03 [2019-03-29 02:14:35,709 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 23 loop predicates 236.26/194.03 [2019-03-29 02:14:35,709 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 85 states and 99 transitions. cyclomatic complexity: 16 Second operand 5 states. 236.26/194.03 [2019-03-29 02:14:35,860 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 85 states and 99 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 206 states and 231 transitions. Complement of second has 12 states. 236.26/194.03 [2019-03-29 02:14:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 236.26/194.03 [2019-03-29 02:14:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 236.26/194.03 [2019-03-29 02:14:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. 236.26/194.03 [2019-03-29 02:14:35,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 44 letters. 236.26/194.03 [2019-03-29 02:14:35,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:35,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 48 letters. Loop has 44 letters. 236.26/194.03 [2019-03-29 02:14:35,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:35,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 88 letters. 236.26/194.03 [2019-03-29 02:14:35,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:35,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 231 transitions. 236.26/194.03 [2019-03-29 02:14:35,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:14:35,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 92 states and 106 transitions. 236.26/194.03 [2019-03-29 02:14:35,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 236.26/194.03 [2019-03-29 02:14:35,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 236.26/194.03 [2019-03-29 02:14:35,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 106 transitions. 236.26/194.03 [2019-03-29 02:14:35,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:14:35,869 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 106 transitions. 236.26/194.03 [2019-03-29 02:14:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 106 transitions. 236.26/194.03 [2019-03-29 02:14:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. 236.26/194.03 [2019-03-29 02:14:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. 236.26/194.03 [2019-03-29 02:14:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. 236.26/194.03 [2019-03-29 02:14:35,871 INFO L729 BuchiCegarLoop]: Abstraction has 85 states and 98 transitions. 236.26/194.03 [2019-03-29 02:14:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 236.26/194.03 [2019-03-29 02:14:35,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 236.26/194.03 [2019-03-29 02:14:35,872 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 5 states. 236.26/194.03 [2019-03-29 02:14:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.03 [2019-03-29 02:14:35,905 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. 236.26/194.03 [2019-03-29 02:14:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 236.26/194.03 [2019-03-29 02:14:35,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 114 transitions. 236.26/194.03 [2019-03-29 02:14:35,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:14:35,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 94 states and 110 transitions. 236.26/194.03 [2019-03-29 02:14:35,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 236.26/194.03 [2019-03-29 02:14:35,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 236.26/194.03 [2019-03-29 02:14:35,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 110 transitions. 236.26/194.03 [2019-03-29 02:14:35,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:14:35,908 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 110 transitions. 236.26/194.03 [2019-03-29 02:14:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 110 transitions. 236.26/194.03 [2019-03-29 02:14:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. 236.26/194.03 [2019-03-29 02:14:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 236.26/194.03 [2019-03-29 02:14:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. 236.26/194.03 [2019-03-29 02:14:35,911 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 99 transitions. 236.26/194.03 [2019-03-29 02:14:35,911 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 99 transitions. 236.26/194.03 [2019-03-29 02:14:35,911 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 236.26/194.03 [2019-03-29 02:14:35,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 99 transitions. 236.26/194.03 [2019-03-29 02:14:35,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.03 [2019-03-29 02:14:35,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.03 [2019-03-29 02:14:35,912 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.03 [2019-03-29 02:14:35,912 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.03 [2019-03-29 02:14:35,912 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] 236.26/194.03 [2019-03-29 02:14:35,912 INFO L794 eck$LassoCheckResult]: Stem: 18249#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 18250#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18263#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18256#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18270#L15-1 236.26/194.03 [2019-03-29 02:14:35,913 INFO L796 eck$LassoCheckResult]: Loop: 18270#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18251#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18252#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18245#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18246#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18272#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18273#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18247#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18248#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18253#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18254#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18267#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18307#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18306#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18305#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18303#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18257#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18258#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18304#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18302#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18301#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18300#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18299#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18298#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18297#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18296#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18295#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18294#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18293#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18292#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18291#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18290#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18289#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18288#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18287#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18286#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18285#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18284#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18283#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18282#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18281#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18280#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18277#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18279#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18278#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18276#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18275#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18274#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 18270#L15-1 236.26/194.03 [2019-03-29 02:14:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 3 times 236.26/194.03 [2019-03-29 02:14:35,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:35,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1131309507, now seen corresponding path program 10 times 236.26/194.03 [2019-03-29 02:14:35,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:35,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -757854610, now seen corresponding path program 3 times 236.26/194.03 [2019-03-29 02:14:35,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:35,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 137 proven. 10 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:35,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.03 [2019-03-29 02:14:35,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.03 [2019-03-29 02:14:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 236.26/194.03 [2019-03-29 02:14:36,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) 236.26/194.03 [2019-03-29 02:14:36,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 270 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:36,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.03 [2019-03-29 02:14:36,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 12 236.26/194.03 [2019-03-29 02:14:36,219 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 236.26/194.03 [2019-03-29 02:14:36,226 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:14:36,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:14:36,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:14:36,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:14:36,227 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.03 [2019-03-29 02:14:36,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:14:36,227 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:14:36,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 236.26/194.03 [2019-03-29 02:14:36,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:36,228 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:36,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,274 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:36,275 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:36,278 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:36,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:36,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:36,308 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:36,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:36,335 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:36,338 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:36,368 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:36,373 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.03 [2019-03-29 02:14:36,396 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:14:36,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:14:36,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:14:36,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:14:36,397 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.03 [2019-03-29 02:14:36,397 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:36,397 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:14:36,397 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:14:36,397 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 236.26/194.03 [2019-03-29 02:14:36,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:36,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:36,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:36,450 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:36,450 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.03 [2019-03-29 02:14:36,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:36,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:36,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:36,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:36,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:36,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:36,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:36,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:36,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:36,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:36,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:36,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:36,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:36,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:36,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:36,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:36,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:36,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:36,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:14:36,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:36,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:36,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:36,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:36,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:36,464 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.03 [2019-03-29 02:14:36,465 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.03 [2019-03-29 02:14:36,465 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.03 [2019-03-29 02:14:36,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.03 [2019-03-29 02:14:36,466 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.03 [2019-03-29 02:14:36,466 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.03 [2019-03-29 02:14:36,466 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.03 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 236.26/194.03 Supporting invariants [] 236.26/194.03 [2019-03-29 02:14:36,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.03 [2019-03-29 02:14:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:36,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:36,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,616 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 14 predicates after loop cannibalization 236.26/194.03 [2019-03-29 02:14:37,616 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 14 loop predicates 236.26/194.03 [2019-03-29 02:14:37,617 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 99 transitions. cyclomatic complexity: 15 Second operand 6 states. 236.26/194.03 [2019-03-29 02:14:37,793 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 99 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 597 states and 655 transitions. Complement of second has 48 states. 236.26/194.03 [2019-03-29 02:14:37,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states 236.26/194.03 [2019-03-29 02:14:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 236.26/194.03 [2019-03-29 02:14:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. 236.26/194.03 [2019-03-29 02:14:37,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 48 letters. 236.26/194.03 [2019-03-29 02:14:37,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:37,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 52 letters. Loop has 48 letters. 236.26/194.03 [2019-03-29 02:14:37,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:37,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 4 letters. Loop has 96 letters. 236.26/194.03 [2019-03-29 02:14:37,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:14:37,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 655 transitions. 236.26/194.03 [2019-03-29 02:14:37,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 236.26/194.03 [2019-03-29 02:14:37,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 175 states and 197 transitions. 236.26/194.03 [2019-03-29 02:14:37,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 236.26/194.03 [2019-03-29 02:14:37,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 236.26/194.03 [2019-03-29 02:14:37,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 197 transitions. 236.26/194.03 [2019-03-29 02:14:37,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:14:37,804 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 197 transitions. 236.26/194.03 [2019-03-29 02:14:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 197 transitions. 236.26/194.03 [2019-03-29 02:14:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 89. 236.26/194.03 [2019-03-29 02:14:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 236.26/194.03 [2019-03-29 02:14:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. 236.26/194.03 [2019-03-29 02:14:37,807 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 102 transitions. 236.26/194.03 [2019-03-29 02:14:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 236.26/194.03 [2019-03-29 02:14:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 236.26/194.03 [2019-03-29 02:14:37,808 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 12 states. 236.26/194.03 [2019-03-29 02:14:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.03 [2019-03-29 02:14:37,884 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 236.26/194.03 [2019-03-29 02:14:37,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:14:37,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 236.26/194.03 [2019-03-29 02:14:37,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 236.26/194.03 [2019-03-29 02:14:37,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:14:37,887 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 113 transitions. 236.26/194.03 [2019-03-29 02:14:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. 236.26/194.03 [2019-03-29 02:14:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. 236.26/194.03 [2019-03-29 02:14:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. 236.26/194.03 [2019-03-29 02:14:37,890 INFO L729 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. 236.26/194.03 [2019-03-29 02:14:37,890 INFO L609 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. 236.26/194.03 [2019-03-29 02:14:37,890 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ 236.26/194.03 [2019-03-29 02:14:37,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. 236.26/194.03 [2019-03-29 02:14:37,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.03 [2019-03-29 02:14:37,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.03 [2019-03-29 02:14:37,891 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.03 [2019-03-29 02:14:37,891 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.03 [2019-03-29 02:14:37,891 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] 236.26/194.03 [2019-03-29 02:14:37,892 INFO L794 eck$LassoCheckResult]: Stem: 26019#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 26020#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26033#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26034#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26042#L15-1 236.26/194.03 [2019-03-29 02:14:37,892 INFO L796 eck$LassoCheckResult]: Loop: 26042#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26060#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26058#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26056#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26054#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26052#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26050#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26048#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26046#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26044#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26045#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26017#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26018#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26031#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26040#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26039#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26027#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26028#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26102#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26101#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26100#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26022#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26015#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26016#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26026#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26099#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26098#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26097#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26096#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26095#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26094#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26093#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26092#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26091#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26090#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26089#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26088#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26087#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26086#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26085#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26083#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26081#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26079#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26077#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26075#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26068#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26072#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26070#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26067#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26065#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26063#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26042#L15-1 236.26/194.03 [2019-03-29 02:14:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 4 times 236.26/194.03 [2019-03-29 02:14:37,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:37,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 816286607, now seen corresponding path program 11 times 236.26/194.03 [2019-03-29 02:14:37,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:37,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:14:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash -207584448, now seen corresponding path program 4 times 236.26/194.03 [2019-03-29 02:14:37,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:14:37,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:14:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:14:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 177 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:37,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.03 [2019-03-29 02:14:37,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.03 [2019-03-29 02:14:37,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 236.26/194.03 [2019-03-29 02:14:37,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 236.26/194.03 [2019-03-29 02:14:37,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:37,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:37,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 177 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:38,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.03 [2019-03-29 02:14:38,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 236.26/194.03 [2019-03-29 02:14:38,213 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 236.26/194.03 [2019-03-29 02:14:38,220 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:14:38,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:14:38,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:14:38,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:14:38,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.03 [2019-03-29 02:14:38,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:14:38,221 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:14:38,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 236.26/194.03 [2019-03-29 02:14:38,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:38,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:38,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,266 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:38,266 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:38,270 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:38,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:38,297 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:38,302 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:38,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:38,328 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:38,332 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:38,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:14:38,336 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:38,362 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.03 [2019-03-29 02:14:38,392 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:14:38,396 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.03 [2019-03-29 02:14:38,419 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:14:38,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:14:38,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:14:38,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:14:38,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.03 [2019-03-29 02:14:38,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:14:38,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:14:38,420 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:14:38,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 236.26/194.03 [2019-03-29 02:14:38,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:14:38,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:14:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:14:38,469 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:14:38,469 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.03 [2019-03-29 02:14:38,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:38,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:38,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:38,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:38,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:38,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:38,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:38,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:38,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:38,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:38,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:14:38,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:38,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:38,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:38,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:38,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:38,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:14:38,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:14:38,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:14:38,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:14:38,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:14:38,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:14:38,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:14:38,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:14:38,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:14:38,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.03 [2019-03-29 02:14:38,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.03 [2019-03-29 02:14:38,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.03 [2019-03-29 02:14:38,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.03 [2019-03-29 02:14:38,480 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.03 [2019-03-29 02:14:38,480 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.03 [2019-03-29 02:14:38,481 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.03 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 236.26/194.03 Supporting invariants [] 236.26/194.03 [2019-03-29 02:14:38,481 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.03 [2019-03-29 02:14:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:14:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:14:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:38,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:38,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:39,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:40,681 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 15 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.26/194.03 [2019-03-29 02:14:41,584 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:42,918 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:44,679 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:46,877 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:49,507 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:14:49,938 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_30 Int)) (<= 15 (+ (* 2 v_prenex_30) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:49,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:49,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:50,385 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_482 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_482) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:50,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:50,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:51,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:51,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:51,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:51,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:52,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:52,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:52,745 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_499 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_499) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:53,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:53,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:53,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:54,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:54,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:54,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:55,115 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_516 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_516) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:14:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:55,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:55,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:56,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:56,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:56,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:56,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:57,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:57,482 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_533 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_533)))) is different from true 236.26/194.03 [2019-03-29 02:14:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:57,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:57,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:58,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:58,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:58,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:58,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:14:59,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:14:59,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:14:59,816 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_550 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_550) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:00,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:00,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:00,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:00,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:01,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:01,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:01,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:01,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:02,165 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_567 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_567)))) is different from true 236.26/194.03 [2019-03-29 02:15:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:02,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:03,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:03,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:03,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:03,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:04,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:04,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:04,500 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_584 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_584) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:04,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:04,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:05,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:05,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:06,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:06,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:06,837 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_601 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_601)))) is different from true 236.26/194.03 [2019-03-29 02:15:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:07,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:07,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:07,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:07,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:08,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:08,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:08,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:08,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:09,167 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_618 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_618) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:09,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:09,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:09,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:09,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:09,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:09,899 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 31 predicates after loop cannibalization 236.26/194.03 [2019-03-29 02:15:09,899 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 31 loop predicates 236.26/194.03 [2019-03-29 02:15:09,899 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 90 states and 104 transitions. cyclomatic complexity: 16 Second operand 7 states. 236.26/194.03 [2019-03-29 02:15:10,233 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 90 states and 104 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 232 states and 256 transitions. Complement of second has 20 states. 236.26/194.03 [2019-03-29 02:15:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states 236.26/194.03 [2019-03-29 02:15:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 236.26/194.03 [2019-03-29 02:15:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. 236.26/194.03 [2019-03-29 02:15:10,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 4 letters. Loop has 52 letters. 236.26/194.03 [2019-03-29 02:15:10,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:10,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 56 letters. Loop has 52 letters. 236.26/194.03 [2019-03-29 02:15:10,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:10,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 4 letters. Loop has 104 letters. 236.26/194.03 [2019-03-29 02:15:10,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:10,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 256 transitions. 236.26/194.03 [2019-03-29 02:15:10,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:15:10,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 236.26/194.03 [2019-03-29 02:15:10,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 236.26/194.03 [2019-03-29 02:15:10,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:15:10,241 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. 236.26/194.03 [2019-03-29 02:15:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. 236.26/194.03 [2019-03-29 02:15:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,244 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 236.26/194.03 [2019-03-29 02:15:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 236.26/194.03 [2019-03-29 02:15:10,244 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 7 states. 236.26/194.03 [2019-03-29 02:15:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.03 [2019-03-29 02:15:10,304 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 236.26/194.03 [2019-03-29 02:15:10,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:15:10,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 236.26/194.03 [2019-03-29 02:15:10,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 236.26/194.03 [2019-03-29 02:15:10,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:15:10,308 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 117 transitions. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L609 BuchiCegarLoop]: Abstraction has 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,310 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ 236.26/194.03 [2019-03-29 02:15:10,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 108 transitions. 236.26/194.03 [2019-03-29 02:15:10,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.03 [2019-03-29 02:15:10,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.03 [2019-03-29 02:15:10,311 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.03 [2019-03-29 02:15:10,312 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.03 [2019-03-29 02:15:10,312 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] 236.26/194.03 [2019-03-29 02:15:10,312 INFO L794 eck$LassoCheckResult]: Stem: 34613#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 34614#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34627#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34628#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34636#L15-1 236.26/194.03 [2019-03-29 02:15:10,313 INFO L796 eck$LassoCheckResult]: Loop: 34636#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34662#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34660#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34658#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34656#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34654#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34652#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34650#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34648#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34646#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34644#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34641#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34640#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34638#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34639#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34611#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34612#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34625#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34634#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34633#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34621#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34622#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34697#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34696#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34695#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34615#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34616#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34609#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34610#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34620#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34693#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34692#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34691#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34690#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34689#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34688#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34687#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34686#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34685#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34684#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34683#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34682#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34681#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34680#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34679#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34678#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34677#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34676#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34675#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34674#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34670#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34673#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 34672#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 34669#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 34667#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 34665#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 34636#L15-1 236.26/194.03 [2019-03-29 02:15:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 5 times 236.26/194.03 [2019-03-29 02:15:10,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:10,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 322865121, now seen corresponding path program 12 times 236.26/194.03 [2019-03-29 02:15:10,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:10,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1017265938, now seen corresponding path program 5 times 236.26/194.03 [2019-03-29 02:15:10,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:10,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:10,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.03 [2019-03-29 02:15:10,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.03 [2019-03-29 02:15:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 236.26/194.03 [2019-03-29 02:15:10,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) 236.26/194.03 [2019-03-29 02:15:10,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:10,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:10,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:10,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.03 [2019-03-29 02:15:10,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 236.26/194.03 [2019-03-29 02:15:10,644 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 236.26/194.03 [2019-03-29 02:15:10,651 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:15:10,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:15:10,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:15:10,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:15:10,651 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.03 [2019-03-29 02:15:10,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:15:10,652 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:15:10,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop 236.26/194.03 [2019-03-29 02:15:10,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:15:10,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:15:10,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,698 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:15:10,698 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:10,701 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:15:10,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:15:10,704 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:10,730 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:15:10,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.03 [2019-03-29 02:15:10,757 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:10,761 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:10,791 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:15:10,795 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.03 [2019-03-29 02:15:10,821 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:15:10,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:15:10,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:15:10,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:15:10,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.03 [2019-03-29 02:15:10,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:10,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:15:10,822 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:15:10,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop 236.26/194.03 [2019-03-29 02:15:10,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:15:10,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:15:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:10,868 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:15:10,869 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.03 [2019-03-29 02:15:10,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:15:10,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:15:10,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:15:10,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:15:10,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:15:10,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:15:10,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:15:10,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:15:10,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:15:10,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:15:10,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:15:10,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:15:10,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:15:10,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:15:10,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:15:10,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.03 [2019-03-29 02:15:10,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.03 [2019-03-29 02:15:10,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:15:10,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:15:10,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:15:10,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:15:10,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:15:10,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:15:10,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:15:10,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:15:10,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.03 [2019-03-29 02:15:10,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.03 [2019-03-29 02:15:10,880 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.03 [2019-03-29 02:15:10,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.03 [2019-03-29 02:15:10,880 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.03 [2019-03-29 02:15:10,880 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.03 [2019-03-29 02:15:10,880 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.03 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 236.26/194.03 Supporting invariants [] 236.26/194.03 [2019-03-29 02:15:10,881 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.03 [2019-03-29 02:15:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:10,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:10,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:10,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:10,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:10,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:11,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:11,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:12,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:12,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:12,464 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 20 predicates after loop cannibalization 236.26/194.03 [2019-03-29 02:15:12,465 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 236.26/194.03 [2019-03-29 02:15:12,465 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 94 states and 108 transitions. cyclomatic complexity: 16 Second operand 8 states. 236.26/194.03 [2019-03-29 02:15:13,000 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 94 states and 108 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 662 states and 713 transitions. Complement of second has 72 states. 236.26/194.03 [2019-03-29 02:15:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 1 accepting loop states 236.26/194.03 [2019-03-29 02:15:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 236.26/194.03 [2019-03-29 02:15:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. 236.26/194.03 [2019-03-29 02:15:13,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 4 letters. Loop has 56 letters. 236.26/194.03 [2019-03-29 02:15:13,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:13,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 60 letters. Loop has 56 letters. 236.26/194.03 [2019-03-29 02:15:13,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:13,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 4 letters. Loop has 112 letters. 236.26/194.03 [2019-03-29 02:15:13,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.03 [2019-03-29 02:15:13,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 713 transitions. 236.26/194.03 [2019-03-29 02:15:13,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 236.26/194.03 [2019-03-29 02:15:13,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 184 states and 205 transitions. 236.26/194.03 [2019-03-29 02:15:13,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 236.26/194.03 [2019-03-29 02:15:13,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 236.26/194.03 [2019-03-29 02:15:13,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 205 transitions. 236.26/194.03 [2019-03-29 02:15:13,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:15:13,010 INFO L706 BuchiCegarLoop]: Abstraction has 184 states and 205 transitions. 236.26/194.03 [2019-03-29 02:15:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 205 transitions. 236.26/194.03 [2019-03-29 02:15:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 98. 236.26/194.03 [2019-03-29 02:15:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. 236.26/194.03 [2019-03-29 02:15:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,013 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 236.26/194.03 [2019-03-29 02:15:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 236.26/194.03 [2019-03-29 02:15:13,013 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. 236.26/194.03 [2019-03-29 02:15:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.03 [2019-03-29 02:15:13,082 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 236.26/194.03 [2019-03-29 02:15:13,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.03 [2019-03-29 02:15:13,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 236.26/194.03 [2019-03-29 02:15:13,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 236.26/194.03 [2019-03-29 02:15:13,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.03 [2019-03-29 02:15:13,085 INFO L706 BuchiCegarLoop]: Abstraction has 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 121 transitions. 236.26/194.03 [2019-03-29 02:15:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. 236.26/194.03 [2019-03-29 02:15:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. 236.26/194.03 [2019-03-29 02:15:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,088 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,088 INFO L609 BuchiCegarLoop]: Abstraction has 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,088 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ 236.26/194.03 [2019-03-29 02:15:13,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 112 transitions. 236.26/194.03 [2019-03-29 02:15:13,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.03 [2019-03-29 02:15:13,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.03 [2019-03-29 02:15:13,089 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.03 [2019-03-29 02:15:13,089 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.03 [2019-03-29 02:15:13,089 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] 236.26/194.03 [2019-03-29 02:15:13,090 INFO L794 eck$LassoCheckResult]: Stem: 44988#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 44989#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45002#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45003#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45011#L15-1 236.26/194.03 [2019-03-29 02:15:13,090 INFO L796 eck$LassoCheckResult]: Loop: 45011#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45042#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45041#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45040#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45039#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45037#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45035#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45033#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45031#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45029#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45027#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45025#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45023#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45018#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45019#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45075#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45074#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45073#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 44986#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44987#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45000#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45009#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45008#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44996#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44997#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45072#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45071#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45070#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44990#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 44991#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 44984#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 44985#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44995#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45068#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45067#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45066#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45065#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45064#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45063#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45062#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45061#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45060#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45059#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45058#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45057#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45056#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45055#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45054#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45053#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45052#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45051#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45050#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45049#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45046#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45048#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 45047#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 45045#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45044#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 45043#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 45011#L15-1 236.26/194.03 [2019-03-29 02:15:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 6 times 236.26/194.03 [2019-03-29 02:15:13,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:13,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1636103373, now seen corresponding path program 13 times 236.26/194.03 [2019-03-29 02:15:13,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:13,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:13,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.03 [2019-03-29 02:15:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912932, now seen corresponding path program 6 times 236.26/194.03 [2019-03-29 02:15:13,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.03 [2019-03-29 02:15:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.03 [2019-03-29 02:15:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.03 [2019-03-29 02:15:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 257 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:13,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.03 [2019-03-29 02:15:13,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.03 [2019-03-29 02:15:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 236.26/194.03 [2019-03-29 02:15:13,223 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) 236.26/194.03 [2019-03-29 02:15:13,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 257 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.03 [2019-03-29 02:15:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 236.26/194.03 [2019-03-29 02:15:13,485 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 236.26/194.03 [2019-03-29 02:15:13,492 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:15:13,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:15:13,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:15:13,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:15:13,492 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.03 [2019-03-29 02:15:13,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:13,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:15:13,493 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:15:13,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop 236.26/194.03 [2019-03-29 02:15:13,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:15:13,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:15:13,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,539 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:15:13,539 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:13,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:13,542 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.03 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.03 Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:13,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.03 [2019-03-29 02:15:13,572 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.03 [2019-03-29 02:15:13,576 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.03 [2019-03-29 02:15:13,599 INFO L216 LassoAnalysis]: Preferences: 236.26/194.03 [2019-03-29 02:15:13,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.03 [2019-03-29 02:15:13,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.03 [2019-03-29 02:15:13,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.03 [2019-03-29 02:15:13,599 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.03 [2019-03-29 02:15:13,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.03 [2019-03-29 02:15:13,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.03 [2019-03-29 02:15:13,600 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.03 [2019-03-29 02:15:13,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop 236.26/194.03 [2019-03-29 02:15:13,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.03 [2019-03-29 02:15:13,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.03 [2019-03-29 02:15:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.03 [2019-03-29 02:15:13,655 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.03 [2019-03-29 02:15:13,655 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.03 [2019-03-29 02:15:13,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.03 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.03 Number of strict supporting invariants: 0 236.26/194.03 Number of non-strict supporting invariants: 1 236.26/194.03 Consider only non-deceasing supporting invariants: true 236.26/194.03 Simplify termination arguments: true 236.26/194.03 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.03 [2019-03-29 02:15:13,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.03 [2019-03-29 02:15:13,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.03 [2019-03-29 02:15:13,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.03 [2019-03-29 02:15:13,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.03 [2019-03-29 02:15:13,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.03 [2019-03-29 02:15:13,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.03 [2019-03-29 02:15:13,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.03 [2019-03-29 02:15:13,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.03 [2019-03-29 02:15:13,661 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.03 [2019-03-29 02:15:13,661 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.03 [2019-03-29 02:15:13,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.03 [2019-03-29 02:15:13,661 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.03 [2019-03-29 02:15:13,661 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.03 [2019-03-29 02:15:13,662 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.03 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 236.26/194.03 Supporting invariants [] 236.26/194.03 [2019-03-29 02:15:13,662 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.03 [2019-03-29 02:15:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.03 [2019-03-29 02:15:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.03 [2019-03-29 02:15:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:13,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:13,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:14,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:14,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:15,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:15,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:15,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:15,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:15,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:15,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:15,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:15,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:16,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:16,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:16,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:16,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:17,195 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 17 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.26/194.03 [2019-03-29 02:15:18,109 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:19,446 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:21,225 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:23,436 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:26,097 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:29,200 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:32,726 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.03 [2019-03-29 02:15:33,160 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_57 Int)) (<= 17 (+ (* 2 v_prenex_57) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:33,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:33,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:33,609 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1090 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1090) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:34,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:34,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:34,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:34,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:35,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:35,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:35,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:35,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:35,998 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1115 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1115)))) is different from true 236.26/194.03 [2019-03-29 02:15:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:36,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:36,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:36,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:36,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:37,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:37,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:37,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:38,398 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1140 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1140) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:38,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:38,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:39,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:39,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:39,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:39,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:40,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:40,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:40,776 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1165 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1165) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:41,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:41,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:41,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:42,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:42,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:42,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:42,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:43,152 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1190 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1190)))) is different from true 236.26/194.03 [2019-03-29 02:15:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:43,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:43,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:44,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:44,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:44,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:44,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:45,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:45,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:45,522 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1215 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1215) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:46,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:46,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:46,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:46,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:46,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:46,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:47,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:47,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:47,893 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1240 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1240) c_oldRank0))) is different from true 236.26/194.03 [2019-03-29 02:15:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:48,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:48,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:48,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:48,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:49,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:49,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.03 [2019-03-29 02:15:49,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.03 [2019-03-29 02:15:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.03 [2019-03-29 02:15:50,269 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1265 Int)) (<= 17 (+ (* 2 v_ULTIMATE.start_main_~i~0_1265) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:15:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:50,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:50,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:51,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:51,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:51,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:52,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:52,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:52,629 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1290 Int)) (<= 17 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1290)))) is different from true 236.26/194.04 [2019-03-29 02:15:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:53,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:53,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:53,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:53,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:53,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:53,488 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 39 predicates after loop cannibalization 236.26/194.04 [2019-03-29 02:15:53,489 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 39 loop predicates 236.26/194.04 [2019-03-29 02:15:53,489 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 98 states and 112 transitions. cyclomatic complexity: 16 Second operand 9 states. 236.26/194.04 [2019-03-29 02:15:54,073 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 98 states and 112 transitions. cyclomatic complexity: 16. Second operand 9 states. Result 256 states and 278 transitions. Complement of second has 28 states. 236.26/194.04 [2019-03-29 02:15:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states 236.26/194.04 [2019-03-29 02:15:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 236.26/194.04 [2019-03-29 02:15:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. 236.26/194.04 [2019-03-29 02:15:54,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 4 letters. Loop has 60 letters. 236.26/194.04 [2019-03-29 02:15:54,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:54,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 64 letters. Loop has 60 letters. 236.26/194.04 [2019-03-29 02:15:54,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:54,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 4 letters. Loop has 120 letters. 236.26/194.04 [2019-03-29 02:15:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:54,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 278 transitions. 236.26/194.04 [2019-03-29 02:15:54,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.04 [2019-03-29 02:15:54,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 236.26/194.04 [2019-03-29 02:15:54,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 236.26/194.04 [2019-03-29 02:15:54,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:15:54,081 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. 236.26/194.04 [2019-03-29 02:15:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. 236.26/194.04 [2019-03-29 02:15:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,083 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 236.26/194.04 [2019-03-29 02:15:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 236.26/194.04 [2019-03-29 02:15:54,083 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 9 states. 236.26/194.04 [2019-03-29 02:15:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.04 [2019-03-29 02:15:54,142 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 236.26/194.04 [2019-03-29 02:15:54,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.04 [2019-03-29 02:15:54,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 236.26/194.04 [2019-03-29 02:15:54,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 236.26/194.04 [2019-03-29 02:15:54,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:15:54,145 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 125 transitions. 236.26/194.04 [2019-03-29 02:15:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. 236.26/194.04 [2019-03-29 02:15:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. 236.26/194.04 [2019-03-29 02:15:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,148 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,148 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,148 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ 236.26/194.04 [2019-03-29 02:15:54,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 116 transitions. 236.26/194.04 [2019-03-29 02:15:54,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.04 [2019-03-29 02:15:54,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.04 [2019-03-29 02:15:54,149 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.04 [2019-03-29 02:15:54,149 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.04 [2019-03-29 02:15:54,149 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] 236.26/194.04 [2019-03-29 02:15:54,150 INFO L794 eck$LassoCheckResult]: Stem: 56329#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 56330#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56342#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56343#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56352#L15-1 236.26/194.04 [2019-03-29 02:15:54,150 INFO L796 eck$LassoCheckResult]: Loop: 56352#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56383#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56382#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56381#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56380#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56379#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56378#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56377#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56376#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56375#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56374#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56373#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56371#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56369#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56367#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56365#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56363#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56361#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56359#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56360#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56416#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56415#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56414#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56327#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56328#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56333#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56334#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56348#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56338#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56339#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56413#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56412#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56411#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56331#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56332#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56325#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56326#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56337#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56409#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56408#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56407#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56406#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56405#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56404#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56403#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56402#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56401#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56400#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56399#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56398#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56397#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56396#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56395#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56394#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56393#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56392#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56391#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56390#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56387#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56389#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56388#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56386#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56385#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56384#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56352#L15-1 236.26/194.04 [2019-03-29 02:15:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:54,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 7 times 236.26/194.04 [2019-03-29 02:15:54,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:54,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1715574149, now seen corresponding path program 14 times 236.26/194.04 [2019-03-29 02:15:54,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:54,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash -921203786, now seen corresponding path program 7 times 236.26/194.04 [2019-03-29 02:15:54,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 297 proven. 78 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:54,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.04 [2019-03-29 02:15:54,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.04 [2019-03-29 02:15:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:54,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:54,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 297 proven. 78 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:54,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.04 [2019-03-29 02:15:54,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 236.26/194.04 [2019-03-29 02:15:54,621 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 60 236.26/194.04 [2019-03-29 02:15:54,631 INFO L216 LassoAnalysis]: Preferences: 236.26/194.04 [2019-03-29 02:15:54,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.04 [2019-03-29 02:15:54,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.04 [2019-03-29 02:15:54,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.04 [2019-03-29 02:15:54,631 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.04 [2019-03-29 02:15:54,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:54,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.04 [2019-03-29 02:15:54,632 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.04 [2019-03-29 02:15:54,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop 236.26/194.04 [2019-03-29 02:15:54,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.04 [2019-03-29 02:15:54,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.04 [2019-03-29 02:15:54,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,694 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.04 [2019-03-29 02:15:54,694 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:54,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:54,700 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 [2019-03-29 02:15:54,727 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.04 [2019-03-29 02:15:54,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:54,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:54,731 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:54,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:54,762 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 [2019-03-29 02:15:54,767 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.04 [2019-03-29 02:15:54,792 INFO L216 LassoAnalysis]: Preferences: 236.26/194.04 [2019-03-29 02:15:54,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.04 [2019-03-29 02:15:54,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.04 [2019-03-29 02:15:54,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.04 [2019-03-29 02:15:54,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.04 [2019-03-29 02:15:54,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:54,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.04 [2019-03-29 02:15:54,793 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.04 [2019-03-29 02:15:54,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop 236.26/194.04 [2019-03-29 02:15:54,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.04 [2019-03-29 02:15:54,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.04 [2019-03-29 02:15:54,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:54,844 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.04 [2019-03-29 02:15:54,845 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.04 [2019-03-29 02:15:54,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:54,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:54,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:54,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:54,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:54,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:54,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:54,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.04 [2019-03-29 02:15:54,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:54,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:54,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:54,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:54,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:54,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:54,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:54,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.04 [2019-03-29 02:15:54,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:54,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:54,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.04 [2019-03-29 02:15:54,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:54,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:54,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:54,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:54,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:54,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.04 [2019-03-29 02:15:54,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.04 [2019-03-29 02:15:54,857 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.04 [2019-03-29 02:15:54,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.04 [2019-03-29 02:15:54,857 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.04 [2019-03-29 02:15:54,857 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.04 [2019-03-29 02:15:54,857 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.04 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 236.26/194.04 Supporting invariants [] 236.26/194.04 [2019-03-29 02:15:54,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.04 [2019-03-29 02:15:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:54,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:54,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:54,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:54,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:54,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:54,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:55,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:55,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:56,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:57,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:57,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:57,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:57,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:57,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:57,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:57,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:57,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:57,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:57,264 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 29 predicates after loop cannibalization 236.26/194.04 [2019-03-29 02:15:57,264 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 29 loop predicates 236.26/194.04 [2019-03-29 02:15:57,264 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 102 states and 116 transitions. cyclomatic complexity: 16 Second operand 10 states. 236.26/194.04 [2019-03-29 02:15:58,064 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 102 states and 116 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 734 states and 781 transitions. Complement of second has 116 states. 236.26/194.04 [2019-03-29 02:15:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 20 non-accepting loop states 1 accepting loop states 236.26/194.04 [2019-03-29 02:15:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 236.26/194.04 [2019-03-29 02:15:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. 236.26/194.04 [2019-03-29 02:15:58,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 4 letters. Loop has 64 letters. 236.26/194.04 [2019-03-29 02:15:58,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:58,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 68 letters. Loop has 64 letters. 236.26/194.04 [2019-03-29 02:15:58,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:58,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 90 transitions. Stem has 4 letters. Loop has 128 letters. 236.26/194.04 [2019-03-29 02:15:58,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:15:58,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 734 states and 781 transitions. 236.26/194.04 [2019-03-29 02:15:58,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 236.26/194.04 [2019-03-29 02:15:58,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 734 states to 194 states and 214 transitions. 236.26/194.04 [2019-03-29 02:15:58,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 236.26/194.04 [2019-03-29 02:15:58,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 236.26/194.04 [2019-03-29 02:15:58,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 214 transitions. 236.26/194.04 [2019-03-29 02:15:58,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:15:58,075 INFO L706 BuchiCegarLoop]: Abstraction has 194 states and 214 transitions. 236.26/194.04 [2019-03-29 02:15:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 214 transitions. 236.26/194.04 [2019-03-29 02:15:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 106. 236.26/194.04 [2019-03-29 02:15:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 236.26/194.04 [2019-03-29 02:15:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,078 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 236.26/194.04 [2019-03-29 02:15:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 236.26/194.04 [2019-03-29 02:15:58,078 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 10 states. 236.26/194.04 [2019-03-29 02:15:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.04 [2019-03-29 02:15:58,157 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 236.26/194.04 [2019-03-29 02:15:58,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 236.26/194.04 [2019-03-29 02:15:58,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 236.26/194.04 [2019-03-29 02:15:58,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 236.26/194.04 [2019-03-29 02:15:58,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:15:58,161 INFO L706 BuchiCegarLoop]: Abstraction has 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 129 transitions. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,163 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ 236.26/194.04 [2019-03-29 02:15:58,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 120 transitions. 236.26/194.04 [2019-03-29 02:15:58,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 236.26/194.04 [2019-03-29 02:15:58,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.04 [2019-03-29 02:15:58,164 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.04 [2019-03-29 02:15:58,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.04 [2019-03-29 02:15:58,165 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] 236.26/194.04 [2019-03-29 02:15:58,165 INFO L794 eck$LassoCheckResult]: Stem: 69758#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 69759#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69772#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69773#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69780#L15-1 236.26/194.04 [2019-03-29 02:15:58,166 INFO L796 eck$LassoCheckResult]: Loop: 69780#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69811#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69810#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69809#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69808#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69807#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69806#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69805#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69804#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69803#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69802#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69801#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69800#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69799#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69798#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69797#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69796#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69795#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69794#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69793#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69792#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69790#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69787#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69788#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69845#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69844#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69843#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69756#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69757#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69770#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69778#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69775#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69766#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69767#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69838#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69840#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69839#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69760#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69761#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69754#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69755#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69765#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69837#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69836#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69835#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69834#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69833#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69832#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69831#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69830#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69829#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69828#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69827#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69826#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69825#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69824#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69823#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69822#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69821#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69820#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69819#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69818#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69815#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69817#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 69816#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69814#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 69813#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 69812#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 69780#L15-1 236.26/194.04 [2019-03-29 02:15:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 8 times 236.26/194.04 [2019-03-29 02:15:58,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2016847575, now seen corresponding path program 15 times 236.26/194.04 [2019-03-29 02:15:58,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:15:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash -170648440, now seen corresponding path program 8 times 236.26/194.04 [2019-03-29 02:15:58,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:15:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:15:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:15:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 337 proven. 105 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:58,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 236.26/194.04 [2019-03-29 02:15:58,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 236.26/194.04 [2019-03-29 02:15:58,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 236.26/194.04 [2019-03-29 02:15:58,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 236.26/194.04 [2019-03-29 02:15:58,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:58,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:58,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 337 proven. 105 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 236.26/194.04 [2019-03-29 02:15:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 236.26/194.04 [2019-03-29 02:15:58,558 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 236.26/194.04 [2019-03-29 02:15:58,565 INFO L216 LassoAnalysis]: Preferences: 236.26/194.04 [2019-03-29 02:15:58,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.04 [2019-03-29 02:15:58,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.04 [2019-03-29 02:15:58,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.04 [2019-03-29 02:15:58,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true 236.26/194.04 [2019-03-29 02:15:58,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.04 [2019-03-29 02:15:58,566 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.04 [2019-03-29 02:15:58,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop 236.26/194.04 [2019-03-29 02:15:58,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.04 [2019-03-29 02:15:58,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.04 [2019-03-29 02:15:58,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,613 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.04 [2019-03-29 02:15:58,613 INFO L412 LassoAnalysis]: Checking for nontermination... 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:58,616 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 [2019-03-29 02:15:58,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.04 [2019-03-29 02:15:58,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:58,646 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 [2019-03-29 02:15:58,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. 236.26/194.04 [2019-03-29 02:15:58,673 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:58,680 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 236.26/194.04 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 236.26/194.04 Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 236.26/194.04 [2019-03-29 02:15:58,709 INFO L163 nArgumentSynthesizer]: Using integer mode. 236.26/194.04 [2019-03-29 02:15:58,713 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 236.26/194.04 [2019-03-29 02:15:58,736 INFO L216 LassoAnalysis]: Preferences: 236.26/194.04 [2019-03-29 02:15:58,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 236.26/194.04 [2019-03-29 02:15:58,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 236.26/194.04 [2019-03-29 02:15:58,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 236.26/194.04 [2019-03-29 02:15:58,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false 236.26/194.04 [2019-03-29 02:15:58,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 236.26/194.04 [2019-03-29 02:15:58,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 236.26/194.04 [2019-03-29 02:15:58,737 INFO L130 ssoRankerPreferences]: Path of dumped script: 236.26/194.04 [2019-03-29 02:15:58,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop 236.26/194.04 [2019-03-29 02:15:58,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 236.26/194.04 [2019-03-29 02:15:58,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 236.26/194.04 [2019-03-29 02:15:58,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 236.26/194.04 [2019-03-29 02:15:58,784 INFO L300 LassoAnalysis]: Preprocessing complete. 236.26/194.04 [2019-03-29 02:15:58,785 INFO L497 LassoAnalysis]: Using template 'affine'. 236.26/194.04 [2019-03-29 02:15:58,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:58,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:58,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:58,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:58,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:58,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:58,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:58,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.04 [2019-03-29 02:15:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:58,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:58,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:58,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:58,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:58,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:58,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:58,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 236.26/194.04 [2019-03-29 02:15:58,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 236.26/194.04 Termination analysis: LINEAR_WITH_GUESSES 236.26/194.04 Number of strict supporting invariants: 0 236.26/194.04 Number of non-strict supporting invariants: 1 236.26/194.04 Consider only non-deceasing supporting invariants: true 236.26/194.04 Simplify termination arguments: true 236.26/194.04 Simplify supporting invariants: trueOverapproximate stem: false 236.26/194.04 [2019-03-29 02:15:58,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. 236.26/194.04 [2019-03-29 02:15:58,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 236.26/194.04 [2019-03-29 02:15:58,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 236.26/194.04 [2019-03-29 02:15:58,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 236.26/194.04 [2019-03-29 02:15:58,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 236.26/194.04 [2019-03-29 02:15:58,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 236.26/194.04 [2019-03-29 02:15:58,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 236.26/194.04 [2019-03-29 02:15:58,794 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 236.26/194.04 [2019-03-29 02:15:58,795 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 236.26/194.04 [2019-03-29 02:15:58,795 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 236.26/194.04 [2019-03-29 02:15:58,796 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 236.26/194.04 [2019-03-29 02:15:58,796 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 236.26/194.04 [2019-03-29 02:15:58,796 INFO L518 LassoAnalysis]: Proved termination. 236.26/194.04 [2019-03-29 02:15:58,796 INFO L520 LassoAnalysis]: Termination argument consisting of: 236.26/194.04 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 236.26/194.04 Supporting invariants [] 236.26/194.04 [2019-03-29 02:15:58,796 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 236.26/194.04 [2019-03-29 02:15:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:15:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:58,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:58,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:58,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:58,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. 236.26/194.04 [2019-03-29 02:15:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:58,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:58,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:15:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:15:59,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:15:59,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:00,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:00,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:01,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:01,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:02,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:02,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:03,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:03,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:04,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:04,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:05,330 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 19 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 236.26/194.04 [2019-03-29 02:16:06,250 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:07,600 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:09,390 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:11,625 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:14,299 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:17,405 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:20,956 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:24,935 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 236.26/194.04 [2019-03-29 02:16:29,365 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 11 236.26/194.04 [2019-03-29 02:16:29,804 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_84 Int)) (<= 19 (+ (* 2 v_prenex_84) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:29,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:29,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:30,257 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2050 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2050)))) is different from true 236.26/194.04 [2019-03-29 02:16:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:30,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:31,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:31,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:31,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:31,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:32,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:32,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:32,696 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2083 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2083)))) is different from true 236.26/194.04 [2019-03-29 02:16:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:33,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:33,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:33,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:33,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:34,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:34,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:34,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:34,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:35,129 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2116 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2116) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:35,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:35,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:36,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:36,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:36,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:36,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:37,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:37,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:37,572 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2149 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2149) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:38,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:38,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:38,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:38,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:39,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:39,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:39,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:39,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:40,001 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2182 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2182)))) is different from true 236.26/194.04 [2019-03-29 02:16:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:40,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:40,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:40,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:40,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:41,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:41,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:41,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:41,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:42,426 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2215 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2215) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:42,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:42,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:43,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:43,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:43,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:43,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:44,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:44,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:44,851 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2248 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2248) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:45,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:45,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:45,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:46,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:46,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:46,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:46,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:47,278 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2281 Int)) (<= 19 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_2281)))) is different from true 236.26/194.04 [2019-03-29 02:16:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:47,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:48,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:48,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:48,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:48,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:49,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:49,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:49,703 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_2314 Int)) (<= 19 (+ (* 2 v_ULTIMATE.start_main_~i~0_2314) c_oldRank0))) is different from true 236.26/194.04 [2019-03-29 02:16:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:50,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:50,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:50,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:50,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 236.26/194.04 [2019-03-29 02:16:50,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core 236.26/194.04 [2019-03-29 02:16:50,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 236.26/194.04 [2019-03-29 02:16:50,702 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 56 predicates after loop cannibalization 236.26/194.04 [2019-03-29 02:16:50,702 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 56 loop predicates 236.26/194.04 [2019-03-29 02:16:50,702 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 106 states and 120 transitions. cyclomatic complexity: 16 Second operand 11 states. 236.26/194.04 [2019-03-29 02:17:08,892 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 106 states and 120 transitions. cyclomatic complexity: 16. Second operand 11 states. Result 862 states and 909 transitions. Complement of second has 188 states. 236.26/194.04 [2019-03-29 02:17:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 1 stem states 27 non-accepting loop states 1 accepting loop states 236.26/194.04 [2019-03-29 02:17:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 236.26/194.04 [2019-03-29 02:17:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 128 transitions. 236.26/194.04 [2019-03-29 02:17:08,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 4 letters. Loop has 68 letters. 236.26/194.04 [2019-03-29 02:17:08,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:17:08,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 72 letters. Loop has 68 letters. 236.26/194.04 [2019-03-29 02:17:08,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:17:08,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 128 transitions. Stem has 4 letters. Loop has 136 letters. 236.26/194.04 [2019-03-29 02:17:08,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. 236.26/194.04 [2019-03-29 02:17:08,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 862 states and 909 transitions. 236.26/194.04 [2019-03-29 02:17:08,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 236.26/194.04 [2019-03-29 02:17:08,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 862 states to 189 states and 204 transitions. 236.26/194.04 [2019-03-29 02:17:08,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 236.26/194.04 [2019-03-29 02:17:08,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 236.26/194.04 [2019-03-29 02:17:08,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 204 transitions. 236.26/194.04 [2019-03-29 02:17:08,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:17:08,902 INFO L706 BuchiCegarLoop]: Abstraction has 189 states and 204 transitions. 236.26/194.04 [2019-03-29 02:17:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 204 transitions. 236.26/194.04 [2019-03-29 02:17:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 153. 236.26/194.04 [2019-03-29 02:17:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. 236.26/194.04 [2019-03-29 02:17:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. 236.26/194.04 [2019-03-29 02:17:08,905 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 168 transitions. 236.26/194.04 [2019-03-29 02:17:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 236.26/194.04 [2019-03-29 02:17:08,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 236.26/194.04 [2019-03-29 02:17:08,906 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand 11 states. 236.26/194.04 [2019-03-29 02:17:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 236.26/194.04 [2019-03-29 02:17:08,985 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. 236.26/194.04 [2019-03-29 02:17:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 236.26/194.04 [2019-03-29 02:17:08,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 198 transitions. 236.26/194.04 [2019-03-29 02:17:08,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 236.26/194.04 [2019-03-29 02:17:08,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 150 states and 163 transitions. 236.26/194.04 [2019-03-29 02:17:08,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 236.26/194.04 [2019-03-29 02:17:08,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 236.26/194.04 [2019-03-29 02:17:08,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 163 transitions. 236.26/194.04 [2019-03-29 02:17:08,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 236.26/194.04 [2019-03-29 02:17:08,989 INFO L706 BuchiCegarLoop]: Abstraction has 150 states and 163 transitions. 236.26/194.04 [2019-03-29 02:17:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 163 transitions. 236.26/194.04 [2019-03-29 02:17:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. 236.26/194.04 [2019-03-29 02:17:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 236.26/194.04 [2019-03-29 02:17:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. 236.26/194.04 [2019-03-29 02:17:08,992 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 118 transitions. 236.26/194.04 [2019-03-29 02:17:08,992 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 118 transitions. 236.26/194.04 [2019-03-29 02:17:08,992 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ 236.26/194.04 [2019-03-29 02:17:08,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 118 transitions. 236.26/194.04 [2019-03-29 02:17:08,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 236.26/194.04 [2019-03-29 02:17:08,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 236.26/194.04 [2019-03-29 02:17:08,993 INFO L119 BuchiIsEmpty]: Starting construction of run 236.26/194.04 [2019-03-29 02:17:08,993 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 236.26/194.04 [2019-03-29 02:17:08,993 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] 236.26/194.04 [2019-03-29 02:17:08,993 INFO L794 eck$LassoCheckResult]: Stem: 85124#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~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_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 85125#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85137#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85138#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85143#L15-1 236.26/194.04 [2019-03-29 02:17:08,994 INFO L796 eck$LassoCheckResult]: Loop: 85143#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85177#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85176#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85175#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85174#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85173#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85172#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85171#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85170#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85169#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85168#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85167#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85166#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85165#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85164#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85163#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85162#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85161#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85160#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85159#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85158#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85157#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85156#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85155#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85154#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85153#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85151#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85152#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85183#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85181#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85144#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85122#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85123#L15-1 [57] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85128#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85129#L12 [42] L12-->L12-2: Formula: (and (= 1 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85140#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85133#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85134#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85130#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85120#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85121#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85126#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85127#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85225#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85224#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85223#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85222#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85221#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85220#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85219#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85218#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85217#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85216#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85215#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85214#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85213#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85212#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85211#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85210#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85209#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85208#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85207#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85206#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85205#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85204#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85203#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85185#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85184#L12-2 [56] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 85182#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 85180#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 85179#L12 [54] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 85178#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 85143#L15-1 236.26/194.04 [2019-03-29 02:17:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:17:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2096690, now seen corresponding path program 9 times 236.26/194.04 [2019-03-29 02:17:08,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:17:08,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:17:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:08,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:17:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098345, now seen corresponding path program 16 times 236.26/194.04 [2019-03-29 02:17:08,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:17:08,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:17:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 236.26/194.04 [2019-03-29 02:17:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1566045274, now seen corresponding path program 9 times 236.26/194.04 [2019-03-29 02:17:09,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 236.26/194.04 [2019-03-29 02:17:09,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 236.26/194.04 [2019-03-29 02:17:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 236.26/194.04 [2019-03-29 02:17:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 236.26/194.04 [2019-03-29 02:17:09,303 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 236.26/194.04 [2019-03-29 02:17:09,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:17:09 BasicIcfg 236.26/194.04 [2019-03-29 02:17:09,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 236.26/194.04 [2019-03-29 02:17:09,353 INFO L168 Benchmark]: Toolchain (without parser) took 189679.45 ms. Allocated memory was 649.6 MB in the beginning and 826.8 MB in the end (delta: 177.2 MB). Free memory was 558.4 MB in the beginning and 496.8 MB in the end (delta: 61.6 MB). Peak memory consumption was 238.8 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,353 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.86 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.75 ms. Allocated memory is still 649.6 MB. Free memory was 548.8 MB in the beginning and 617.3 MB in the end (delta: -68.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,354 INFO L168 Benchmark]: Boogie Preprocessor took 19.99 ms. Allocated memory is still 649.6 MB. Free memory was 617.3 MB in the beginning and 614.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,355 INFO L168 Benchmark]: RCFGBuilder took 200.39 ms. Allocated memory is still 649.6 MB. Free memory was 614.2 MB in the beginning and 601.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,355 INFO L168 Benchmark]: BlockEncodingV2 took 80.41 ms. Allocated memory is still 649.6 MB. Free memory was 599.8 MB in the beginning and 594.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,355 INFO L168 Benchmark]: TraceAbstraction took 152.90 ms. Allocated memory is still 649.6 MB. Free memory was 593.4 MB in the beginning and 585.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,356 INFO L168 Benchmark]: BuchiAutomizer took 188908.88 ms. Allocated memory was 649.6 MB in the beginning and 826.8 MB in the end (delta: 177.2 MB). Free memory was 585.3 MB in the beginning and 496.8 MB in the end (delta: 88.5 MB). Peak memory consumption was 265.7 MB. Max. memory is 50.3 GB. 236.26/194.04 [2019-03-29 02:17:09,360 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 236.26/194.04 --- Results --- 236.26/194.04 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 236.26/194.04 - StatisticsResult: Initial Icfg 236.26/194.04 9 locations, 13 edges 236.26/194.04 - StatisticsResult: Encoded RCFG 236.26/194.04 5 locations, 11 edges 236.26/194.04 * Results from de.uni_freiburg.informatik.ultimate.core: 236.26/194.04 - StatisticsResult: Toolchain Benchmarks 236.26/194.04 Benchmark results are: 236.26/194.04 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 236.26/194.04 * CACSL2BoogieTranslator took 221.86 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 236.26/194.04 * Boogie Procedure Inliner took 89.75 ms. Allocated memory is still 649.6 MB. Free memory was 548.8 MB in the beginning and 617.3 MB in the end (delta: -68.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 236.26/194.04 * Boogie Preprocessor took 19.99 ms. Allocated memory is still 649.6 MB. Free memory was 617.3 MB in the beginning and 614.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 236.26/194.04 * RCFGBuilder took 200.39 ms. Allocated memory is still 649.6 MB. Free memory was 614.2 MB in the beginning and 601.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 236.26/194.04 * BlockEncodingV2 took 80.41 ms. Allocated memory is still 649.6 MB. Free memory was 599.8 MB in the beginning and 594.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 236.26/194.04 * TraceAbstraction took 152.90 ms. Allocated memory is still 649.6 MB. Free memory was 593.4 MB in the beginning and 585.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 236.26/194.04 * BuchiAutomizer took 188908.88 ms. Allocated memory was 649.6 MB in the beginning and 826.8 MB in the end (delta: 177.2 MB). Free memory was 585.3 MB in the beginning and 496.8 MB in the end (delta: 88.5 MB). Peak memory consumption was 265.7 MB. Max. memory is 50.3 GB. 236.26/194.04 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 236.26/194.04 - AllSpecificationsHoldResult: All specifications hold 236.26/194.04 We were not able to verify any specifiation because the program does not contain any specification. 236.26/194.04 - InvariantResult [Line: 11]: Loop Invariant 236.26/194.04 Derived loop invariant: 1 236.26/194.04 - StatisticsResult: Ultimate Automizer benchmark data 236.26/194.04 CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 236.26/194.04 - StatisticsResult: Constructed decomposition of program 236.26/194.04 Your program was decomposed into 32 terminating modules (20 trivial, 0 deterministic, 12 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -1 * i + 5 and consists of 14 locations. One nondeterministic module has affine ranking function -2 * i + 13 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 7 and consists of 11 locations. One nondeterministic module has affine ranking function -2 * i + 15 and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + 8 and consists of 15 locations. One nondeterministic module has affine ranking function -2 * i + 17 and consists of 9 locations. One nondeterministic module has affine ranking function -1 * i + 9 and consists of 23 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 30 locations. 20 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 106 locations. 236.26/194.04 - StatisticsResult: Timing statistics 236.26/194.04 BüchiAutomizer plugin needed 188.8s and 23 iterations. TraceHistogramMax:18. Analysis of lassos took 7.9s. Construction of modules took 2.0s. Büchi inclusion checks took 178.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 31. Automata minimization 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 1196 StatesRemovedByMinimization, 31 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 161 states and ocurred in iteration 3. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1242/2784 HoareTripleCheckerStatistics: 155 SDtfs, 919 SDslu, 32 SDs, 0 SdLazy, 2524 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT2 conc0 concLT9 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax184 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf89 smp97 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s 236.26/194.04 - TerminationAnalysisResult: Nontermination possible 236.26/194.04 Buchi Automizer proved that your program is nonterminating for some inputs 236.26/194.04 - FixpointNonTerminationResult [Line: 18]: Nontermination argument in form of an infinite program execution. 236.26/194.04 Nontermination argument in form of an infinite execution 236.26/194.04 State at position 0 is 236.26/194.04 {} 236.26/194.04 State at position 1 is 236.26/194.04 {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67fdfc8e=0, \result=0, i=10} 236.26/194.04 - StatisticsResult: NonterminationArgumentStatistics 236.26/194.04 Fixpoint 236.26/194.04 - NonterminatingLassoResult [Line: 11]: Nonterminating execution 236.26/194.04 Found a nonterminating execution for the following lasso shaped sequence of statements. 236.26/194.04 Stem: 236.26/194.04 [L6] int i; 236.26/194.04 [L7] int up; 236.26/194.04 [L8] i = __VERIFIER_nondet_int() 236.26/194.04 [L9] up = 0 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND TRUE i == 10 236.26/194.04 [L16] up = 0 236.26/194.04 Loop: 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND FALSE !(up == 1) 236.26/194.04 [L21] i = i-1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND TRUE i == 1 236.26/194.04 [L13] up = 1 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND FALSE !(i == 10) 236.26/194.04 [L18] COND TRUE up == 1 236.26/194.04 [L19] i = i+1 236.26/194.04 [L11] COND TRUE i > 0 236.26/194.04 [L12] COND FALSE !(i == 1) 236.26/194.04 [L15] COND TRUE i == 10 236.26/194.04 [L16] up = 0 236.26/194.04 End of lasso representation. 236.26/194.04 RESULT: Ultimate proved your program to be incorrect! 236.26/194.04 !SESSION 2019-03-29 02:13:56.272 ----------------------------------------------- 236.26/194.04 eclipse.buildId=unknown 236.26/194.04 java.version=1.8.0_181 236.26/194.04 java.vendor=Oracle Corporation 236.26/194.04 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 236.26/194.04 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 236.26/194.04 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 236.26/194.04 236.26/194.04 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 02:17:09.599 236.26/194.04 !MESSAGE The workspace will exit with unsaved changes in this session. 236.26/194.04 Received shutdown request... 236.26/194.04 Ultimate: 236.26/194.04 GTK+ Version Check 236.26/194.04 EOF