79.21/40.83 NO 79.21/40.83 79.21/40.83 Ultimate: Cannot open display: 79.21/40.83 This is Ultimate 0.1.24-8dc7c08-m 79.21/40.83 [2019-03-28 22:38:46,293 INFO L170 SettingsManager]: Resetting all preferences to default values... 79.21/40.83 [2019-03-28 22:38:46,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 79.21/40.83 [2019-03-28 22:38:46,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 79.21/40.83 [2019-03-28 22:38:46,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 79.21/40.83 [2019-03-28 22:38:46,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 79.21/40.83 [2019-03-28 22:38:46,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 79.21/40.83 [2019-03-28 22:38:46,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 79.21/40.83 [2019-03-28 22:38:46,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 79.21/40.83 [2019-03-28 22:38:46,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 79.21/40.83 [2019-03-28 22:38:46,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 79.21/40.83 [2019-03-28 22:38:46,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 79.21/40.83 [2019-03-28 22:38:46,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 79.21/40.83 [2019-03-28 22:38:46,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 79.21/40.83 [2019-03-28 22:38:46,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 79.21/40.83 [2019-03-28 22:38:46,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 79.21/40.83 [2019-03-28 22:38:46,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 79.21/40.83 [2019-03-28 22:38:46,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 79.21/40.83 [2019-03-28 22:38:46,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 79.21/40.83 [2019-03-28 22:38:46,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 79.21/40.83 [2019-03-28 22:38:46,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 79.21/40.83 [2019-03-28 22:38:46,329 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 79.21/40.83 [2019-03-28 22:38:46,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 79.21/40.83 [2019-03-28 22:38:46,330 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 79.21/40.83 [2019-03-28 22:38:46,331 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 79.21/40.83 [2019-03-28 22:38:46,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 79.21/40.83 [2019-03-28 22:38:46,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 79.21/40.83 [2019-03-28 22:38:46,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 79.21/40.83 [2019-03-28 22:38:46,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 79.21/40.83 [2019-03-28 22:38:46,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 79.21/40.83 [2019-03-28 22:38:46,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 79.21/40.83 [2019-03-28 22:38:46,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 79.21/40.83 [2019-03-28 22:38:46,336 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 79.21/40.83 [2019-03-28 22:38:46,351 INFO L110 SettingsManager]: Loading preferences was successful 79.21/40.83 [2019-03-28 22:38:46,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 79.21/40.83 [2019-03-28 22:38:46,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 79.21/40.83 [2019-03-28 22:38:46,353 INFO L133 SettingsManager]: * Rewrite not-equals=true 79.21/40.83 [2019-03-28 22:38:46,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 79.21/40.83 [2019-03-28 22:38:46,353 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 79.21/40.83 [2019-03-28 22:38:46,353 INFO L133 SettingsManager]: * Use SBE=true 79.21/40.83 [2019-03-28 22:38:46,353 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 79.21/40.83 [2019-03-28 22:38:46,353 INFO L133 SettingsManager]: * Use old map elimination=false 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 79.21/40.83 [2019-03-28 22:38:46,354 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:46,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 79.21/40.83 [2019-03-28 22:38:46,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 79.21/40.83 [2019-03-28 22:38:46,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE 79.21/40.83 [2019-03-28 22:38:46,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 79.21/40.83 [2019-03-28 22:38:46,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 79.21/40.83 [2019-03-28 22:38:46,355 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 79.21/40.83 [2019-03-28 22:38:46,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 79.21/40.83 [2019-03-28 22:38:46,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 79.21/40.83 [2019-03-28 22:38:46,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 79.21/40.83 [2019-03-28 22:38:46,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 79.21/40.83 [2019-03-28 22:38:46,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 79.21/40.83 [2019-03-28 22:38:46,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 79.21/40.83 [2019-03-28 22:38:46,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 79.21/40.83 [2019-03-28 22:38:46,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 79.21/40.83 [2019-03-28 22:38:46,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 79.21/40.83 [2019-03-28 22:38:46,395 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 79.21/40.83 [2019-03-28 22:38:46,399 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 79.21/40.83 [2019-03-28 22:38:46,400 INFO L271 PluginConnector]: Initializing CDTParser... 79.21/40.83 [2019-03-28 22:38:46,400 INFO L276 PluginConnector]: CDTParser initialized 79.21/40.83 [2019-03-28 22:38:46,401 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 79.21/40.83 [2019-03-28 22:38:46,465 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7452bb36f1cf429ca6c5e555f943ee67/FLAG08ab337e7 79.21/40.83 [2019-03-28 22:38:46,819 INFO L307 CDTParser]: Found 1 translation units. 79.21/40.83 [2019-03-28 22:38:46,820 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 79.21/40.83 [2019-03-28 22:38:46,826 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7452bb36f1cf429ca6c5e555f943ee67/FLAG08ab337e7 79.21/40.83 [2019-03-28 22:38:47,225 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7452bb36f1cf429ca6c5e555f943ee67 79.21/40.83 [2019-03-28 22:38:47,237 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 79.21/40.83 [2019-03-28 22:38:47,239 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 79.21/40.83 [2019-03-28 22:38:47,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 79.21/40.83 [2019-03-28 22:38:47,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 79.21/40.83 [2019-03-28 22:38:47,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 79.21/40.83 [2019-03-28 22:38:47,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4337f75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:47,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 79.21/40.83 [2019-03-28 22:38:47,275 INFO L176 MainTranslator]: Built tables and reachable declarations 79.21/40.83 [2019-03-28 22:38:47,436 INFO L206 PostProcessor]: Analyzing one entry point: main 79.21/40.83 [2019-03-28 22:38:47,440 INFO L191 MainTranslator]: Completed pre-run 79.21/40.83 [2019-03-28 22:38:47,458 INFO L206 PostProcessor]: Analyzing one entry point: main 79.21/40.83 [2019-03-28 22:38:47,473 INFO L195 MainTranslator]: Completed translation 79.21/40.83 [2019-03-28 22:38:47,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47 WrapperNode 79.21/40.83 [2019-03-28 22:38:47,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 79.21/40.83 [2019-03-28 22:38:47,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 79.21/40.83 [2019-03-28 22:38:47,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 79.21/40.83 [2019-03-28 22:38:47,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 79.21/40.83 [2019-03-28 22:38:47,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 79.21/40.83 [2019-03-28 22:38:47,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 79.21/40.83 [2019-03-28 22:38:47,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 79.21/40.83 [2019-03-28 22:38:47,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized 79.21/40.83 [2019-03-28 22:38:47,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 79.21/40.83 [2019-03-28 22:38:47,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 79.21/40.83 [2019-03-28 22:38:47,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... 79.21/40.83 [2019-03-28 22:38:47,597 INFO L276 PluginConnector]: RCFGBuilder initialized 79.21/40.83 [2019-03-28 22:38:47,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (1/1) ... 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 79.21/40.83 [2019-03-28 22:38:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 79.21/40.83 [2019-03-28 22:38:47,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 79.21/40.83 [2019-03-28 22:38:47,796 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 79.21/40.83 [2019-03-28 22:38:47,796 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 79.21/40.83 [2019-03-28 22:38:47,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:38:47 BoogieIcfgContainer 79.21/40.83 [2019-03-28 22:38:47,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 79.21/40.83 [2019-03-28 22:38:47,798 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 79.21/40.83 [2019-03-28 22:38:47,798 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 79.21/40.83 [2019-03-28 22:38:47,800 INFO L276 PluginConnector]: BlockEncodingV2 initialized 79.21/40.83 [2019-03-28 22:38:47,801 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:38:47" (1/1) ... 79.21/40.83 [2019-03-28 22:38:47,815 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 79.21/40.83 [2019-03-28 22:38:47,817 INFO L258 BlockEncoder]: Using Remove infeasible edges 79.21/40.83 [2019-03-28 22:38:47,818 INFO L263 BlockEncoder]: Using Maximize final states 79.21/40.83 [2019-03-28 22:38:47,818 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 79.21/40.83 [2019-03-28 22:38:47,819 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 79.21/40.83 [2019-03-28 22:38:47,821 INFO L296 BlockEncoder]: Using Remove sink states 79.21/40.83 [2019-03-28 22:38:47,822 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 79.21/40.83 [2019-03-28 22:38:47,822 INFO L179 BlockEncoder]: Using Rewrite not-equals 79.21/40.83 [2019-03-28 22:38:47,838 INFO L185 BlockEncoder]: Using Use SBE 79.21/40.83 [2019-03-28 22:38:47,855 INFO L200 BlockEncoder]: SBE split 4 edges 79.21/40.83 [2019-03-28 22:38:47,860 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 79.21/40.83 [2019-03-28 22:38:47,862 INFO L71 MaximizeFinalStates]: 0 new accepting states 79.21/40.83 [2019-03-28 22:38:47,872 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 79.21/40.83 [2019-03-28 22:38:47,874 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 79.21/40.83 [2019-03-28 22:38:47,876 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 79.21/40.83 [2019-03-28 22:38:47,876 INFO L71 MaximizeFinalStates]: 0 new accepting states 79.21/40.83 [2019-03-28 22:38:47,876 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 79.21/40.83 [2019-03-28 22:38:47,877 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 79.21/40.83 [2019-03-28 22:38:47,877 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 79.21/40.83 [2019-03-28 22:38:47,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:38:47 BasicIcfg 79.21/40.83 [2019-03-28 22:38:47,878 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 79.21/40.83 [2019-03-28 22:38:47,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 79.21/40.83 [2019-03-28 22:38:47,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... 79.21/40.83 [2019-03-28 22:38:47,882 INFO L276 PluginConnector]: TraceAbstraction initialized 79.21/40.83 [2019-03-28 22:38:47,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:38:47" (1/4) ... 79.21/40.83 [2019-03-28 22:38:47,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:38:47, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:47,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (2/4) ... 79.21/40.83 [2019-03-28 22:38:47,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:38:47, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:47,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:38:47" (3/4) ... 79.21/40.83 [2019-03-28 22:38:47,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:38:47, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:47,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:38:47" (4/4) ... 79.21/40.83 [2019-03-28 22:38:47,886 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 79.21/40.83 [2019-03-28 22:38:47,897 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 79.21/40.83 [2019-03-28 22:38:47,905 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 79.21/40.83 [2019-03-28 22:38:47,922 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 79.21/40.83 [2019-03-28 22:38:47,951 INFO L133 ementStrategyFactory]: Using default assertion order modulation 79.21/40.83 [2019-03-28 22:38:47,952 INFO L382 AbstractCegarLoop]: Interprodecural is true 79.21/40.83 [2019-03-28 22:38:47,952 INFO L383 AbstractCegarLoop]: Hoare is true 79.21/40.83 [2019-03-28 22:38:47,952 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 79.21/40.83 [2019-03-28 22:38:47,953 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 79.21/40.83 [2019-03-28 22:38:47,953 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 79.21/40.83 [2019-03-28 22:38:47,953 INFO L387 AbstractCegarLoop]: Difference is false 79.21/40.83 [2019-03-28 22:38:47,953 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 79.21/40.83 [2019-03-28 22:38:47,953 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 79.21/40.83 [2019-03-28 22:38:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 79.21/40.83 [2019-03-28 22:38:47,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 79.21/40.83 [2019-03-28 22:38:47,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 79.21/40.83 [2019-03-28 22:38:48,026 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 11 23) the Hoare annotation is: true 79.21/40.83 [2019-03-28 22:38:48,026 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 11 23) no Hoare annotation was computed. 79.21/40.83 [2019-03-28 22:38:48,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 79.21/40.83 [2019-03-28 22:38:48,027 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 79.21/40.83 [2019-03-28 22:38:48,027 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 23) no Hoare annotation was computed. 79.21/40.83 [2019-03-28 22:38:48,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:38:48 BasicIcfg 79.21/40.83 [2019-03-28 22:38:48,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 79.21/40.83 [2019-03-28 22:38:48,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 79.21/40.83 [2019-03-28 22:38:48,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 79.21/40.83 [2019-03-28 22:38:48,039 INFO L276 PluginConnector]: BuchiAutomizer initialized 79.21/40.83 [2019-03-28 22:38:48,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 79.21/40.83 [2019-03-28 22:38:48,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:38:47" (1/5) ... 79.21/40.83 [2019-03-28 22:38:48,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6410ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:38:48, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:48,041 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 79.21/40.83 [2019-03-28 22:38:48,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:38:47" (2/5) ... 79.21/40.83 [2019-03-28 22:38:48,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6410ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:38:48, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:48,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 79.21/40.83 [2019-03-28 22:38:48,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:38:47" (3/5) ... 79.21/40.83 [2019-03-28 22:38:48,043 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6410ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:38:48, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:48,043 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 79.21/40.83 [2019-03-28 22:38:48,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:38:47" (4/5) ... 79.21/40.83 [2019-03-28 22:38:48,043 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6410ca0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:38:48, skipping insertion in model container 79.21/40.83 [2019-03-28 22:38:48,043 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 79.21/40.83 [2019-03-28 22:38:48,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:38:48" (5/5) ... 79.21/40.83 [2019-03-28 22:38:48,045 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 79.21/40.83 [2019-03-28 22:38:48,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation 79.21/40.83 [2019-03-28 22:38:48,073 INFO L374 BuchiCegarLoop]: Interprodecural is true 79.21/40.83 [2019-03-28 22:38:48,073 INFO L375 BuchiCegarLoop]: Hoare is true 79.21/40.83 [2019-03-28 22:38:48,074 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 79.21/40.83 [2019-03-28 22:38:48,074 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 79.21/40.83 [2019-03-28 22:38:48,074 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 79.21/40.83 [2019-03-28 22:38:48,074 INFO L379 BuchiCegarLoop]: Difference is false 79.21/40.83 [2019-03-28 22:38:48,074 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 79.21/40.83 [2019-03-28 22:38:48,074 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 79.21/40.83 [2019-03-28 22:38:48,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 79.21/40.83 [2019-03-28 22:38:48,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 79.21/40.83 [2019-03-28 22:38:48,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:48,097 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:48,104 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 79.21/40.83 [2019-03-28 22:38:48,104 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:48,104 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 79.21/40.83 [2019-03-28 22:38:48,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 79.21/40.83 [2019-03-28 22:38:48,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 79.21/40.83 [2019-03-28 22:38:48,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:48,106 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:48,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 79.21/40.83 [2019-03-28 22:38:48,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:48,111 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 79.21/40.83 [2019-03-28 22:38:48,112 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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 [55] L12-->L12-2: Formula: (< 10 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 (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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 [59] 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 79.21/40.83 [2019-03-28 22:38:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:48,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2198982, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:48,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 79.21/40.83 [2019-03-28 22:38:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 79.21/40.83 [2019-03-28 22:38:48,244 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.83 [2019-03-28 22:38:48,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 79.21/40.83 [2019-03-28 22:38:48,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 79.21/40.83 [2019-03-28 22:38:48,261 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. 79.21/40.83 [2019-03-28 22:38:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.83 [2019-03-28 22:38:48,297 INFO L93 Difference]: Finished difference Result 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 79.21/40.83 [2019-03-28 22:38:48,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 79.21/40.83 [2019-03-28 22:38:48,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 79.21/40.83 [2019-03-28 22:38:48,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 79.21/40.83 [2019-03-28 22:38:48,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 79.21/40.83 [2019-03-28 22:38:48,309 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 11 transitions. 79.21/40.83 [2019-03-28 22:38:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. 79.21/40.83 [2019-03-28 22:38:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 79.21/40.83 [2019-03-28 22:38:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. 79.21/40.83 [2019-03-28 22:38:48,338 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. 79.21/40.83 [2019-03-28 22:38:48,339 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. 79.21/40.83 [2019-03-28 22:38:48,339 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 79.21/40.83 [2019-03-28 22:38:48,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. 79.21/40.83 [2019-03-28 22:38:48,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 79.21/40.83 [2019-03-28 22:38:48,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:48,340 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:48,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 79.21/40.83 [2019-03-28 22:38:48,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:48,341 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 79.21/40.83 [2019-03-28 22:38:48,341 INFO L796 eck$LassoCheckResult]: Loop: 23#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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 [56] L12-->L12-2: Formula: (> 10 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 (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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 [59] 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 79.21/40.83 [2019-03-28 22:38:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times 79.21/40.83 [2019-03-28 22:38:48,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2199943, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:48,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 79.21/40.83 [2019-03-28 22:38:48,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 79.21/40.83 [2019-03-28 22:38:48,373 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.83 [2019-03-28 22:38:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 79.21/40.83 [2019-03-28 22:38:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 79.21/40.83 [2019-03-28 22:38:48,374 INFO L87 Difference]: Start difference. First operand 5 states and 10 transitions. cyclomatic complexity: 6 Second operand 3 states. 79.21/40.83 [2019-03-28 22:38:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.83 [2019-03-28 22:38:48,416 INFO L93 Difference]: Finished difference Result 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 79.21/40.83 [2019-03-28 22:38:48,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 79.21/40.83 [2019-03-28 22:38:48,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 79.21/40.83 [2019-03-28 22:38:48,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 79.21/40.83 [2019-03-28 22:38:48,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 79.21/40.83 [2019-03-28 22:38:48,420 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 79.21/40.83 [2019-03-28 22:38:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 79.21/40.83 [2019-03-28 22:38:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,423 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,423 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,424 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 79.21/40.83 [2019-03-28 22:38:48,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 18 transitions. 79.21/40.83 [2019-03-28 22:38:48,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 79.21/40.83 [2019-03-28 22:38:48,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:48,424 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:48,425 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 79.21/40.83 [2019-03-28 22:38:48,425 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:48,425 INFO L794 eck$LassoCheckResult]: Stem: 43#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] 44#L18-1 79.21/40.83 [2019-03-28 22:38:48,426 INFO L796 eck$LassoCheckResult]: Loop: 44#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 45#L12 [56] L12-->L12-2: Formula: (> 10 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[] 40#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 42#L15-1 [59] 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] 44#L18-1 79.21/40.83 [2019-03-28 22:38:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times 79.21/40.83 [2019-03-28 22:38:48,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2200594, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:48,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:48,442 INFO L82 PathProgramCache]: Analyzing trace with hash 65000022, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:48,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:48,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:48,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:48,501 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:48,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:48,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:48,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:48,503 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.83 [2019-03-28 22:38:48,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:48,503 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:48,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 79.21/40.83 [2019-03-28 22:38:48,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:48,504 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:48,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,611 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.83 [2019-03-28 22:38:48,612 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:48,620 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:48,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:48,652 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: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:48,660 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:48,686 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:48,687 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: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:48,692 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:48,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:48,720 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: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:48,725 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:48,756 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:48,762 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.83 [2019-03-28 22:38:48,786 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:48,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:48,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:48,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:48,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.83 [2019-03-28 22:38:48,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:48,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:48,788 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:48,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 79.21/40.83 [2019-03-28 22:38:48,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:48,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:48,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:48,904 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.83 [2019-03-28 22:38:48,910 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.83 [2019-03-28 22:38:48,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:48,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:48,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.83 [2019-03-28 22:38:48,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:48,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:48,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:48,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:48,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:48,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:48,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:48,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:48,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:48,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:48,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:48,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:48,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:48,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:48,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:48,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:48,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:48,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:48,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:48,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:48,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:48,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:48,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:48,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:48,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.83 [2019-03-28 22:38:48,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:48,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:48,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:48,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:48,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:48,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.83 [2019-03-28 22:38:48,969 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.83 [2019-03-28 22:38:48,969 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.83 [2019-03-28 22:38:48,971 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.83 [2019-03-28 22:38:48,972 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.83 [2019-03-28 22:38:48,972 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.83 [2019-03-28 22:38:48,973 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.83 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.83 Supporting invariants [] 79.21/40.83 [2019-03-28 22:38:48,974 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.83 [2019-03-28 22:38:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,147 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 79.21/40.83 [2019-03-28 22:38:49,150 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 79.21/40.83 [2019-03-28 22:38:49,151 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10 Second operand 3 states. 79.21/40.83 [2019-03-28 22:38:49,400 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 89 states and 172 transitions. Complement of second has 16 states. 79.21/40.83 [2019-03-28 22:38:49,401 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 79.21/40.83 [2019-03-28 22:38:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 79.21/40.83 [2019-03-28 22:38:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. 79.21/40.83 [2019-03-28 22:38:49,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 1 letters. Loop has 4 letters. 79.21/40.83 [2019-03-28 22:38:49,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:49,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. 79.21/40.83 [2019-03-28 22:38:49,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:49,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 1 letters. Loop has 8 letters. 79.21/40.83 [2019-03-28 22:38:49,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:49,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 172 transitions. 79.21/40.83 [2019-03-28 22:38:49,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 79.21/40.83 [2019-03-28 22:38:49,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 116 transitions. 79.21/40.83 [2019-03-28 22:38:49,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 79.21/40.83 [2019-03-28 22:38:49,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 79.21/40.83 [2019-03-28 22:38:49,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 116 transitions. 79.21/40.83 [2019-03-28 22:38:49,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.83 [2019-03-28 22:38:49,420 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 116 transitions. 79.21/40.83 [2019-03-28 22:38:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 116 transitions. 79.21/40.83 [2019-03-28 22:38:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. 79.21/40.83 [2019-03-28 22:38:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 79.21/40.83 [2019-03-28 22:38:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 103 transitions. 79.21/40.83 [2019-03-28 22:38:49,428 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 103 transitions. 79.21/40.83 [2019-03-28 22:38:49,428 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 103 transitions. 79.21/40.83 [2019-03-28 22:38:49,429 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 79.21/40.83 [2019-03-28 22:38:49,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 103 transitions. 79.21/40.83 [2019-03-28 22:38:49,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 79.21/40.83 [2019-03-28 22:38:49,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:49,431 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:49,433 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:49,433 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:49,433 INFO L794 eck$LassoCheckResult]: Stem: 224#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] 225#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 230#L12 [56] L12-->L12-2: Formula: (> 10 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[] 231#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 277#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] 250#L18-1 79.21/40.83 [2019-03-28 22:38:49,433 INFO L796 eck$LassoCheckResult]: Loop: 250#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 274#L12 [56] L12-->L12-2: Formula: (> 10 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[] 275#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 266#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] 250#L18-1 79.21/40.83 [2019-03-28 22:38:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:49,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2200580, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:49,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1809524160, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:49,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:49,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:49,503 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:49,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:49,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:49,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:49,504 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.83 [2019-03-28 22:38:49,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:49,504 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:49,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 79.21/40.83 [2019-03-28 22:38:49,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:49,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:49,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,596 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.83 [2019-03-28 22:38:49,596 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:49,602 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:49,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:49,630 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: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:49,637 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:49,641 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:49,641 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:49,670 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:49,699 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:49,699 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: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:49,705 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:49,736 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:49,741 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.83 [2019-03-28 22:38:49,766 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:49,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:49,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:49,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:49,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.83 [2019-03-28 22:38:49,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:49,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:49,767 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:49,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 79.21/40.83 [2019-03-28 22:38:49,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:49,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:49,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:49,829 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.83 [2019-03-28 22:38:49,829 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.83 [2019-03-28 22:38:49,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:49,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:49,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:49,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:49,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:49,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:49,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:49,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:49,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:49,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:49,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.83 [2019-03-28 22:38:49,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:49,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:49,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:49,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:49,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:49,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:49,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:49,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:49,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:49,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:49,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:49,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:49,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:49,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.83 [2019-03-28 22:38:49,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.83 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.83 Number of strict supporting invariants: 0 79.21/40.83 Number of non-strict supporting invariants: 1 79.21/40.83 Consider only non-deceasing supporting invariants: true 79.21/40.83 Simplify termination arguments: true 79.21/40.83 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.83 [2019-03-28 22:38:49,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.83 [2019-03-28 22:38:49,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.83 [2019-03-28 22:38:49,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.83 [2019-03-28 22:38:49,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.83 [2019-03-28 22:38:49,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.83 [2019-03-28 22:38:49,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.83 [2019-03-28 22:38:49,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.83 [2019-03-28 22:38:49,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.83 [2019-03-28 22:38:49,860 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.83 [2019-03-28 22:38:49,860 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 79.21/40.83 [2019-03-28 22:38:49,861 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.83 [2019-03-28 22:38:49,861 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.83 [2019-03-28 22:38:49,862 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.83 [2019-03-28 22:38:49,862 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.83 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 79.21/40.83 Supporting invariants [] 79.21/40.83 [2019-03-28 22:38:49,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.83 [2019-03-28 22:38:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:49,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:49,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:50,003 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 79.21/40.83 [2019-03-28 22:38:50,003 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 79.21/40.83 [2019-03-28 22:38:50,003 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 59 states and 103 transitions. cyclomatic complexity: 48 Second operand 4 states. 79.21/40.83 [2019-03-28 22:38:50,137 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 59 states and 103 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 362 states and 605 transitions. Complement of second has 24 states. 79.21/40.83 [2019-03-28 22:38:50,137 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 79.21/40.83 [2019-03-28 22:38:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 79.21/40.83 [2019-03-28 22:38:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. 79.21/40.83 [2019-03-28 22:38:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 5 letters. Loop has 4 letters. 79.21/40.83 [2019-03-28 22:38:50,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:50,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 9 letters. Loop has 4 letters. 79.21/40.83 [2019-03-28 22:38:50,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:50,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 5 letters. Loop has 8 letters. 79.21/40.83 [2019-03-28 22:38:50,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.83 [2019-03-28 22:38:50,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 605 transitions. 79.21/40.83 [2019-03-28 22:38:50,149 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 79.21/40.83 [2019-03-28 22:38:50,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 151 states and 255 transitions. 79.21/40.83 [2019-03-28 22:38:50,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 79.21/40.83 [2019-03-28 22:38:50,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 79.21/40.83 [2019-03-28 22:38:50,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 255 transitions. 79.21/40.83 [2019-03-28 22:38:50,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.83 [2019-03-28 22:38:50,153 INFO L706 BuchiCegarLoop]: Abstraction has 151 states and 255 transitions. 79.21/40.83 [2019-03-28 22:38:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 255 transitions. 79.21/40.83 [2019-03-28 22:38:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. 79.21/40.83 [2019-03-28 22:38:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. 79.21/40.83 [2019-03-28 22:38:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 206 transitions. 79.21/40.83 [2019-03-28 22:38:50,163 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 206 transitions. 79.21/40.83 [2019-03-28 22:38:50,163 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 206 transitions. 79.21/40.83 [2019-03-28 22:38:50,164 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 79.21/40.83 [2019-03-28 22:38:50,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 206 transitions. 79.21/40.83 [2019-03-28 22:38:50,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 74 79.21/40.83 [2019-03-28 22:38:50,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:50,166 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:50,166 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,166 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,167 INFO L794 eck$LassoCheckResult]: Stem: 736#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] 737#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 738#L12 [56] L12-->L12-2: Formula: (> 10 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[] 744#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 831#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] 756#L18-1 79.21/40.83 [2019-03-28 22:38:50,167 INFO L796 eck$LassoCheckResult]: Loop: 756#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 827#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 758#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 759#L15-1 [60] 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] 816#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 814#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 792#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 793#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] 756#L18-1 79.21/40.83 [2019-03-28 22:38:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 2 times 79.21/40.83 [2019-03-28 22:38:50,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1237277946, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:50,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 79.21/40.83 [2019-03-28 22:38:50,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 79.21/40.83 [2019-03-28 22:38:50,190 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.83 [2019-03-28 22:38:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 79.21/40.83 [2019-03-28 22:38:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 79.21/40.83 [2019-03-28 22:38:50,190 INFO L87 Difference]: Start difference. First operand 121 states and 206 transitions. cyclomatic complexity: 89 Second operand 3 states. 79.21/40.83 [2019-03-28 22:38:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.83 [2019-03-28 22:38:50,207 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. 79.21/40.83 [2019-03-28 22:38:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 79.21/40.83 [2019-03-28 22:38:50,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 179 transitions. 79.21/40.83 [2019-03-28 22:38:50,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 79.21/40.83 [2019-03-28 22:38:50,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 111 states and 167 transitions. 79.21/40.83 [2019-03-28 22:38:50,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 79.21/40.83 [2019-03-28 22:38:50,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 79.21/40.83 [2019-03-28 22:38:50,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 167 transitions. 79.21/40.83 [2019-03-28 22:38:50,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.83 [2019-03-28 22:38:50,212 INFO L706 BuchiCegarLoop]: Abstraction has 111 states and 167 transitions. 79.21/40.83 [2019-03-28 22:38:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 167 transitions. 79.21/40.83 [2019-03-28 22:38:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. 79.21/40.83 [2019-03-28 22:38:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. 79.21/40.83 [2019-03-28 22:38:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. 79.21/40.83 [2019-03-28 22:38:50,221 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. 79.21/40.83 [2019-03-28 22:38:50,221 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. 79.21/40.83 [2019-03-28 22:38:50,221 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 79.21/40.83 [2019-03-28 22:38:50,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. 79.21/40.83 [2019-03-28 22:38:50,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 79.21/40.83 [2019-03-28 22:38:50,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:50,223 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:50,223 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,223 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,224 INFO L794 eck$LassoCheckResult]: Stem: 983#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] 984#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1015#L12 [56] L12-->L12-2: Formula: (> 10 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[] 1074#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 1073#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] 1029#L18-1 79.21/40.83 [2019-03-28 22:38:50,224 INFO L796 eck$LassoCheckResult]: Loop: 1029#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1068#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 1064#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 1061#L15-1 [59] 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] 1066#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1063#L12 [56] L12-->L12-2: Formula: (> 10 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[] 1060#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 1050#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] 1029#L18-1 79.21/40.83 [2019-03-28 22:38:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 3 times 79.21/40.83 [2019-03-28 22:38:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1236367228, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:50,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:50,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.83 [2019-03-28 22:38:50,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.83 [2019-03-28 22:38:50,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:50,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:50,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.83 [2019-03-28 22:38:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 79.21/40.83 [2019-03-28 22:38:50,308 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.83 [2019-03-28 22:38:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 79.21/40.83 [2019-03-28 22:38:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 79.21/40.83 [2019-03-28 22:38:50,309 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 61 Second operand 4 states. 79.21/40.83 [2019-03-28 22:38:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.83 [2019-03-28 22:38:50,340 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. 79.21/40.83 [2019-03-28 22:38:50,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 79.21/40.83 [2019-03-28 22:38:50,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 183 transitions. 79.21/40.83 [2019-03-28 22:38:50,343 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 79.21/40.83 [2019-03-28 22:38:50,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 180 transitions. 79.21/40.83 [2019-03-28 22:38:50,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 79.21/40.83 [2019-03-28 22:38:50,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 79.21/40.83 [2019-03-28 22:38:50,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 180 transitions. 79.21/40.83 [2019-03-28 22:38:50,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.83 [2019-03-28 22:38:50,346 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 180 transitions. 79.21/40.83 [2019-03-28 22:38:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 180 transitions. 79.21/40.83 [2019-03-28 22:38:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. 79.21/40.83 [2019-03-28 22:38:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. 79.21/40.83 [2019-03-28 22:38:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. 79.21/40.83 [2019-03-28 22:38:50,353 INFO L729 BuchiCegarLoop]: Abstraction has 113 states and 168 transitions. 79.21/40.83 [2019-03-28 22:38:50,353 INFO L609 BuchiCegarLoop]: Abstraction has 113 states and 168 transitions. 79.21/40.83 [2019-03-28 22:38:50,353 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 79.21/40.83 [2019-03-28 22:38:50,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 168 transitions. 79.21/40.83 [2019-03-28 22:38:50,354 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 79.21/40.83 [2019-03-28 22:38:50,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.83 [2019-03-28 22:38:50,354 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.83 [2019-03-28 22:38:50,355 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,355 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] 79.21/40.83 [2019-03-28 22:38:50,355 INFO L794 eck$LassoCheckResult]: Stem: 1240#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] 1241#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1274#L12 [56] L12-->L12-2: Formula: (> 10 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[] 1330#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 1329#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] 1314#L18-1 79.21/40.83 [2019-03-28 22:38:50,356 INFO L796 eck$LassoCheckResult]: Loop: 1314#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1327#L12 [56] L12-->L12-2: Formula: (> 10 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[] 1326#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 1325#L15-1 [60] 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] 1324#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 1323#L12 [56] L12-->L12-2: Formula: (> 10 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[] 1320#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 1321#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] 1314#L18-1 79.21/40.83 [2019-03-28 22:38:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 4 times 79.21/40.83 [2019-03-28 22:38:50,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 777440395, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:50,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.83 [2019-03-28 22:38:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.83 [2019-03-28 22:38:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash 456728647, now seen corresponding path program 1 times 79.21/40.83 [2019-03-28 22:38:50,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.83 [2019-03-28 22:38:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.83 [2019-03-28 22:38:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:50,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.83 [2019-03-28 22:38:50,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.83 [2019-03-28 22:38:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.83 [2019-03-28 22:38:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.83 [2019-03-28 22:38:50,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.83 [2019-03-28 22:38:50,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.83 [2019-03-28 22:38:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 79.21/40.83 [2019-03-28 22:38:50,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 79.21/40.83 [2019-03-28 22:38:50,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 79.21/40.83 [2019-03-28 22:38:50,472 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:50,473 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:50,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:50,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:50,473 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.83 [2019-03-28 22:38:50,473 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,473 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:50,474 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:50,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 79.21/40.83 [2019-03-28 22:38:50,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:50,474 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:50,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,529 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.83 [2019-03-28 22:38:50,529 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:50,532 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:50,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:50,536 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=1} Honda state: {ULTIMATE.start_main_~i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:50,563 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:50,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.83 [2019-03-28 22:38:50,590 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:50,595 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.83 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.83 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.83 [2019-03-28 22:38:50,625 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.83 [2019-03-28 22:38:50,656 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.83 [2019-03-28 22:38:50,658 INFO L216 LassoAnalysis]: Preferences: 79.21/40.83 [2019-03-28 22:38:50,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.83 [2019-03-28 22:38:50,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.83 [2019-03-28 22:38:50,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.83 [2019-03-28 22:38:50,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.83 [2019-03-28 22:38:50,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.83 [2019-03-28 22:38:50,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.83 [2019-03-28 22:38:50,659 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.83 [2019-03-28 22:38:50,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 79.21/40.83 [2019-03-28 22:38:50,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.83 [2019-03-28 22:38:50,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.83 [2019-03-28 22:38:50,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.83 [2019-03-28 22:38:50,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:50,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:50,715 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:50,715 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.84 [2019-03-28 22:38:50,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:50,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:50,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:50,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:50,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:50,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:50,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:50,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:50,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.84 [2019-03-28 22:38:50,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:50,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:50,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:50,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:50,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:50,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:50,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:50,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.84 [2019-03-28 22:38:50,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:50,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:50,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:50,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:50,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:50,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:50,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:50,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:50,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.84 [2019-03-28 22:38:50,733 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.84 [2019-03-28 22:38:50,733 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.84 [2019-03-28 22:38:50,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.84 [2019-03-28 22:38:50,734 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.84 [2019-03-28 22:38:50,734 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.84 [2019-03-28 22:38:50,734 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.84 Ranking function f(ULTIMATE.start_main_~up~0) = 1*ULTIMATE.start_main_~up~0 79.21/40.84 Supporting invariants [] 79.21/40.84 [2019-03-28 22:38:50,735 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.84 [2019-03-28 22:38:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:50,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:50,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:50,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:50,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:50,819 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 79.21/40.84 [2019-03-28 22:38:50,820 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 79.21/40.84 [2019-03-28 22:38:50,820 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 113 states and 168 transitions. cyclomatic complexity: 60 Second operand 5 states. 79.21/40.84 [2019-03-28 22:38:50,884 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 113 states and 168 transitions. cyclomatic complexity: 60. Second operand 5 states. Result 405 states and 595 transitions. Complement of second has 36 states. 79.21/40.84 [2019-03-28 22:38:50,885 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 79.21/40.84 [2019-03-28 22:38:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 79.21/40.84 [2019-03-28 22:38:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. 79.21/40.84 [2019-03-28 22:38:50,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 5 letters. Loop has 8 letters. 79.21/40.84 [2019-03-28 22:38:50,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:50,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 13 letters. Loop has 8 letters. 79.21/40.84 [2019-03-28 22:38:50,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:50,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 5 letters. Loop has 16 letters. 79.21/40.84 [2019-03-28 22:38:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:50,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 595 transitions. 79.21/40.84 [2019-03-28 22:38:50,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 79.21/40.84 [2019-03-28 22:38:50,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 76 states and 101 transitions. 79.21/40.84 [2019-03-28 22:38:50,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 79.21/40.84 [2019-03-28 22:38:50,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 79.21/40.84 [2019-03-28 22:38:50,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. 79.21/40.84 [2019-03-28 22:38:50,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:50,897 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 101 transitions. 79.21/40.84 [2019-03-28 22:38:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. 79.21/40.84 [2019-03-28 22:38:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. 79.21/40.84 [2019-03-28 22:38:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 79.21/40.84 [2019-03-28 22:38:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. 79.21/40.84 [2019-03-28 22:38:50,901 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 83 transitions. 79.21/40.84 [2019-03-28 22:38:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 79.21/40.84 [2019-03-28 22:38:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 79.21/40.84 [2019-03-28 22:38:50,901 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 4 states. 79.21/40.84 [2019-03-28 22:38:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:50,916 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. 79.21/40.84 [2019-03-28 22:38:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 79.21/40.84 [2019-03-28 22:38:50,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. 79.21/40.84 [2019-03-28 22:38:50,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 79.21/40.84 [2019-03-28 22:38:50,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. 79.21/40.84 [2019-03-28 22:38:50,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 79.21/40.84 [2019-03-28 22:38:50,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 79.21/40.84 [2019-03-28 22:38:50,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. 79.21/40.84 [2019-03-28 22:38:50,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:50,919 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. 79.21/40.84 [2019-03-28 22:38:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. 79.21/40.84 [2019-03-28 22:38:50,921 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 79.21/40.84 [2019-03-28 22:38:50,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. 79.21/40.84 [2019-03-28 22:38:50,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 79.21/40.84 [2019-03-28 22:38:50,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:50,922 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:50,923 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:50,923 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:50,923 INFO L794 eck$LassoCheckResult]: Stem: 2025#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] 2026#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2042#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2039#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2038#L15-1 79.21/40.84 [2019-03-28 22:38:50,923 INFO L796 eck$LassoCheckResult]: Loop: 2038#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] 2037#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2031#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2021#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2022#L15-1 [59] 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] 2027#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2028#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2047#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2043#L15-1 [59] 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] 2045#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2040#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2041#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2038#L15-1 79.21/40.84 [2019-03-28 22:38:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 1 times 79.21/40.84 [2019-03-28 22:38:50,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:50,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 87680373, now seen corresponding path program 2 times 79.21/40.84 [2019-03-28 22:38:50,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:50,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:50,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:50,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:50,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 79.21/40.84 [2019-03-28 22:38:50,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:50,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:50,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 79.21/40.84 [2019-03-28 22:38:51,007 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 79.21/40.84 [2019-03-28 22:38:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 79.21/40.84 [2019-03-28 22:38:51,008 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 10 Second operand 5 states. 79.21/40.84 [2019-03-28 22:38:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,038 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. 79.21/40.84 [2019-03-28 22:38:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 79.21/40.84 [2019-03-28 22:38:51,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. 79.21/40.84 [2019-03-28 22:38:51,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 79.21/40.84 [2019-03-28 22:38:51,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 50 transitions. 79.21/40.84 [2019-03-28 22:38:51,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 79.21/40.84 [2019-03-28 22:38:51,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 79.21/40.84 [2019-03-28 22:38:51,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. 79.21/40.84 [2019-03-28 22:38:51,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,042 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. 79.21/40.84 [2019-03-28 22:38:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. 79.21/40.84 [2019-03-28 22:38:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. 79.21/40.84 [2019-03-28 22:38:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 79.21/40.84 [2019-03-28 22:38:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. 79.21/40.84 [2019-03-28 22:38:51,044 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. 79.21/40.84 [2019-03-28 22:38:51,044 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. 79.21/40.84 [2019-03-28 22:38:51,044 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 79.21/40.84 [2019-03-28 22:38:51,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. 79.21/40.84 [2019-03-28 22:38:51,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 79.21/40.84 [2019-03-28 22:38:51,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,045 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,046 INFO L794 eck$LassoCheckResult]: Stem: 2134#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] 2135#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2145#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2150#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2149#L15-1 79.21/40.84 [2019-03-28 22:38:51,046 INFO L796 eck$LassoCheckResult]: Loop: 2149#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] 2148#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2140#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2130#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2131#L15-1 [59] 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] 2136#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2137#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2161#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2160#L15-1 [59] 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] 2159#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2158#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2157#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2156#L15-1 [59] 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] 2154#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2151#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2152#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2149#L15-1 79.21/40.84 [2019-03-28 22:38:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 2 times 79.21/40.84 [2019-03-28 22:38:51,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1668514628, now seen corresponding path program 3 times 79.21/40.84 [2019-03-28 22:38:51,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:51,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:51,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 79.21/40.84 [2019-03-28 22:38:51,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:51,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:51,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 79.21/40.84 [2019-03-28 22:38:51,147 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 79.21/40.84 [2019-03-28 22:38:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 79.21/40.84 [2019-03-28 22:38:51,148 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. 79.21/40.84 [2019-03-28 22:38:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,191 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. 79.21/40.84 [2019-03-28 22:38:51,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 79.21/40.84 [2019-03-28 22:38:51,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. 79.21/40.84 [2019-03-28 22:38:51,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 79.21/40.84 [2019-03-28 22:38:51,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 60 transitions. 79.21/40.84 [2019-03-28 22:38:51,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 79.21/40.84 [2019-03-28 22:38:51,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 79.21/40.84 [2019-03-28 22:38:51,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. 79.21/40.84 [2019-03-28 22:38:51,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,195 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. 79.21/40.84 [2019-03-28 22:38:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. 79.21/40.84 [2019-03-28 22:38:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. 79.21/40.84 [2019-03-28 22:38:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 79.21/40.84 [2019-03-28 22:38:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. 79.21/40.84 [2019-03-28 22:38:51,197 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. 79.21/40.84 [2019-03-28 22:38:51,197 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. 79.21/40.84 [2019-03-28 22:38:51,197 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 79.21/40.84 [2019-03-28 22:38:51,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. 79.21/40.84 [2019-03-28 22:38:51,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 79.21/40.84 [2019-03-28 22:38:51,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,198 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,198 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,199 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,199 INFO L794 eck$LassoCheckResult]: Stem: 2272#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] 2273#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2282#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2288#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2287#L15-1 79.21/40.84 [2019-03-28 22:38:51,199 INFO L796 eck$LassoCheckResult]: Loop: 2287#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] 2286#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2278#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2268#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2269#L15-1 [59] 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] 2274#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2275#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2304#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2303#L15-1 [59] 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] 2302#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2301#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2300#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2299#L15-1 [59] 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] 2298#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2297#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2296#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2294#L15-1 [59] 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] 2292#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2289#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2290#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2287#L15-1 79.21/40.84 [2019-03-28 22:38:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 3 times 79.21/40.84 [2019-03-28 22:38:51,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1392795245, now seen corresponding path program 4 times 79.21/40.84 [2019-03-28 22:38:51,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:51,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:51,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 79.21/40.84 [2019-03-28 22:38:51,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:51,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:51,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 79.21/40.84 [2019-03-28 22:38:51,306 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 79.21/40.84 [2019-03-28 22:38:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 79.21/40.84 [2019-03-28 22:38:51,306 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 14 Second operand 7 states. 79.21/40.84 [2019-03-28 22:38:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,339 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. 79.21/40.84 [2019-03-28 22:38:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 79.21/40.84 [2019-03-28 22:38:51,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. 79.21/40.84 [2019-03-28 22:38:51,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 79.21/40.84 [2019-03-28 22:38:51,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 70 transitions. 79.21/40.84 [2019-03-28 22:38:51,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 79.21/40.84 [2019-03-28 22:38:51,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 79.21/40.84 [2019-03-28 22:38:51,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. 79.21/40.84 [2019-03-28 22:38:51,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,343 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. 79.21/40.84 [2019-03-28 22:38:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. 79.21/40.84 [2019-03-28 22:38:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. 79.21/40.84 [2019-03-28 22:38:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 79.21/40.84 [2019-03-28 22:38:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. 79.21/40.84 [2019-03-28 22:38:51,345 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. 79.21/40.84 [2019-03-28 22:38:51,345 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. 79.21/40.84 [2019-03-28 22:38:51,345 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 79.21/40.84 [2019-03-28 22:38:51,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. 79.21/40.84 [2019-03-28 22:38:51,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 79.21/40.84 [2019-03-28 22:38:51,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,346 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,347 INFO L794 eck$LassoCheckResult]: Stem: 2439#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] 2440#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2449#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2455#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2454#L15-1 79.21/40.84 [2019-03-28 22:38:51,347 INFO L796 eck$LassoCheckResult]: Loop: 2454#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] 2453#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2445#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2435#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2436#L15-1 [59] 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] 2441#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2442#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2475#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2474#L15-1 [59] 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] 2473#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2472#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2471#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2470#L15-1 [59] 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] 2469#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2468#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2467#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2466#L15-1 [59] 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] 2465#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2464#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2463#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2461#L15-1 [59] 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] 2459#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2456#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2457#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2454#L15-1 79.21/40.84 [2019-03-28 22:38:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 4 times 79.21/40.84 [2019-03-28 22:38:51,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1650589598, now seen corresponding path program 5 times 79.21/40.84 [2019-03-28 22:38:51,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:51,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 79.21/40.84 [2019-03-28 22:38:51,429 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:51,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:51,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 79.21/40.84 [2019-03-28 22:38:51,464 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 79.21/40.84 [2019-03-28 22:38:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 79.21/40.84 [2019-03-28 22:38:51,464 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 16 Second operand 8 states. 79.21/40.84 [2019-03-28 22:38:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,503 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. 79.21/40.84 [2019-03-28 22:38:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 79.21/40.84 [2019-03-28 22:38:51,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 82 transitions. 79.21/40.84 [2019-03-28 22:38:51,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 79.21/40.84 [2019-03-28 22:38:51,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 80 transitions. 79.21/40.84 [2019-03-28 22:38:51,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 79.21/40.84 [2019-03-28 22:38:51,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 79.21/40.84 [2019-03-28 22:38:51,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 80 transitions. 79.21/40.84 [2019-03-28 22:38:51,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,506 INFO L706 BuchiCegarLoop]: Abstraction has 63 states and 80 transitions. 79.21/40.84 [2019-03-28 22:38:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 80 transitions. 79.21/40.84 [2019-03-28 22:38:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. 79.21/40.84 [2019-03-28 22:38:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 79.21/40.84 [2019-03-28 22:38:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. 79.21/40.84 [2019-03-28 22:38:51,509 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. 79.21/40.84 [2019-03-28 22:38:51,509 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. 79.21/40.84 [2019-03-28 22:38:51,509 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 79.21/40.84 [2019-03-28 22:38:51,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. 79.21/40.84 [2019-03-28 22:38:51,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 79.21/40.84 [2019-03-28 22:38:51,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,510 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,511 INFO L794 eck$LassoCheckResult]: Stem: 2635#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] 2636#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2647#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2653#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2652#L15-1 79.21/40.84 [2019-03-28 22:38:51,512 INFO L796 eck$LassoCheckResult]: Loop: 2652#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] 2651#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2641#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2642#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2675#L15-1 [59] 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] 2637#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2638#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2631#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2632#L15-1 [59] 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] 2644#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2674#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2673#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2672#L15-1 [59] 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] 2671#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2670#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2669#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2668#L15-1 [59] 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] 2667#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2666#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2665#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2664#L15-1 [59] 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] 2663#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2662#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2661#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2659#L15-1 [59] 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] 2657#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2654#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2655#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2652#L15-1 79.21/40.84 [2019-03-28 22:38:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 5 times 79.21/40.84 [2019-03-28 22:38:51,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1522114639, now seen corresponding path program 6 times 79.21/40.84 [2019-03-28 22:38:51,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:51,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 79.21/40.84 [2019-03-28 22:38:51,610 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:51,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:51,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 79.21/40.84 [2019-03-28 22:38:51,645 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 79.21/40.84 [2019-03-28 22:38:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 79.21/40.84 [2019-03-28 22:38:51,645 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 18 Second operand 9 states. 79.21/40.84 [2019-03-28 22:38:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,718 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. 79.21/40.84 [2019-03-28 22:38:51,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 79.21/40.84 [2019-03-28 22:38:51,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. 79.21/40.84 [2019-03-28 22:38:51,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 79.21/40.84 [2019-03-28 22:38:51,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 71 states and 90 transitions. 79.21/40.84 [2019-03-28 22:38:51,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 79.21/40.84 [2019-03-28 22:38:51,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 79.21/40.84 [2019-03-28 22:38:51,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 90 transitions. 79.21/40.84 [2019-03-28 22:38:51,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,722 INFO L706 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. 79.21/40.84 [2019-03-28 22:38:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 90 transitions. 79.21/40.84 [2019-03-28 22:38:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. 79.21/40.84 [2019-03-28 22:38:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. 79.21/40.84 [2019-03-28 22:38:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. 79.21/40.84 [2019-03-28 22:38:51,725 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. 79.21/40.84 [2019-03-28 22:38:51,725 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. 79.21/40.84 [2019-03-28 22:38:51,725 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 79.21/40.84 [2019-03-28 22:38:51,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. 79.21/40.84 [2019-03-28 22:38:51,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 79.21/40.84 [2019-03-28 22:38:51,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,726 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,726 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,727 INFO L794 eck$LassoCheckResult]: Stem: 2860#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] 2861#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2872#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2878#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2877#L15-1 79.21/40.84 [2019-03-28 22:38:51,727 INFO L796 eck$LassoCheckResult]: Loop: 2877#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] 2876#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2866#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 2867#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2903#L15-1 [59] 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] 2862#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2863#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2856#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2857#L15-1 [59] 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] 2869#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2902#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2901#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2900#L15-1 [59] 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] 2899#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2898#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2897#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2896#L15-1 [59] 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] 2895#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2894#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2893#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2892#L15-1 [59] 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] 2891#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2890#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2889#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2888#L15-1 [59] 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] 2887#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2886#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2885#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 2883#L15-1 [59] 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] 2881#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 2879#L12 [56] L12-->L12-2: Formula: (> 10 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[] 2880#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 2877#L15-1 79.21/40.84 [2019-03-28 22:38:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 6 times 79.21/40.84 [2019-03-28 22:38:51,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash -671056000, now seen corresponding path program 7 times 79.21/40.84 [2019-03-28 22:38:51,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:51,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:51,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:51,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 79.21/40.84 [2019-03-28 22:38:51,882 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:51,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 79.21/40.84 [2019-03-28 22:38:51,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 79.21/40.84 [2019-03-28 22:38:51,882 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. cyclomatic complexity: 20 Second operand 10 states. 79.21/40.84 [2019-03-28 22:38:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:51,956 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. 79.21/40.84 [2019-03-28 22:38:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 79.21/40.84 [2019-03-28 22:38:51,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 102 transitions. 79.21/40.84 [2019-03-28 22:38:51,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 79.21/40.84 [2019-03-28 22:38:51,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 100 transitions. 79.21/40.84 [2019-03-28 22:38:51,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 79.21/40.84 [2019-03-28 22:38:51,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 79.21/40.84 [2019-03-28 22:38:51,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. 79.21/40.84 [2019-03-28 22:38:51,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:51,960 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 100 transitions. 79.21/40.84 [2019-03-28 22:38:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. 79.21/40.84 [2019-03-28 22:38:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. 79.21/40.84 [2019-03-28 22:38:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. 79.21/40.84 [2019-03-28 22:38:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. 79.21/40.84 [2019-03-28 22:38:51,963 INFO L729 BuchiCegarLoop]: Abstraction has 75 states and 95 transitions. 79.21/40.84 [2019-03-28 22:38:51,963 INFO L609 BuchiCegarLoop]: Abstraction has 75 states and 95 transitions. 79.21/40.84 [2019-03-28 22:38:51,963 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 79.21/40.84 [2019-03-28 22:38:51,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 95 transitions. 79.21/40.84 [2019-03-28 22:38:51,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 79.21/40.84 [2019-03-28 22:38:51,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:51,964 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:51,965 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,965 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:51,965 INFO L794 eck$LassoCheckResult]: Stem: 3114#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] 3115#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3124#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3130#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3129#L15-1 79.21/40.84 [2019-03-28 22:38:51,966 INFO L796 eck$LassoCheckResult]: Loop: 3129#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] 3128#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3120#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 3110#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3111#L15-1 [59] 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] 3116#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3117#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3162#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3161#L15-1 [59] 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] 3160#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3159#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3158#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3157#L15-1 [59] 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] 3156#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3155#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3154#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3153#L15-1 [59] 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] 3152#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3151#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3150#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3149#L15-1 [59] 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] 3148#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3147#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3146#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3145#L15-1 [59] 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] 3144#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3143#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3142#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3141#L15-1 [59] 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] 3140#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3139#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3138#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3136#L15-1 [59] 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] 3134#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3131#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3132#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3129#L15-1 79.21/40.84 [2019-03-28 22:38:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 7 times 79.21/40.84 [2019-03-28 22:38:51,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash -570941489, now seen corresponding path program 8 times 79.21/40.84 [2019-03-28 22:38:51,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:52,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:52,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 79.21/40.84 [2019-03-28 22:38:52,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:52,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:52,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:52,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:52,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 79.21/40.84 [2019-03-28 22:38:52,119 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 79.21/40.84 [2019-03-28 22:38:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 79.21/40.84 [2019-03-28 22:38:52,120 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. cyclomatic complexity: 22 Second operand 11 states. 79.21/40.84 [2019-03-28 22:38:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:52,209 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. 79.21/40.84 [2019-03-28 22:38:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 79.21/40.84 [2019-03-28 22:38:52,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 112 transitions. 79.21/40.84 [2019-03-28 22:38:52,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 79.21/40.84 [2019-03-28 22:38:52,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 110 transitions. 79.21/40.84 [2019-03-28 22:38:52,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 79.21/40.84 [2019-03-28 22:38:52,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 79.21/40.84 [2019-03-28 22:38:52,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. 79.21/40.84 [2019-03-28 22:38:52,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:52,213 INFO L706 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. 79.21/40.84 [2019-03-28 22:38:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. 79.21/40.84 [2019-03-28 22:38:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. 79.21/40.84 [2019-03-28 22:38:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 79.21/40.84 [2019-03-28 22:38:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. 79.21/40.84 [2019-03-28 22:38:52,216 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. 79.21/40.84 [2019-03-28 22:38:52,216 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. 79.21/40.84 [2019-03-28 22:38:52,216 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 79.21/40.84 [2019-03-28 22:38:52,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 105 transitions. 79.21/40.84 [2019-03-28 22:38:52,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 79.21/40.84 [2019-03-28 22:38:52,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:52,217 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:52,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:52,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:52,218 INFO L794 eck$LassoCheckResult]: Stem: 3397#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] 3398#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3409#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3415#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3414#L15-1 79.21/40.84 [2019-03-28 22:38:52,219 INFO L796 eck$LassoCheckResult]: Loop: 3414#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] 3413#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3403#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 3404#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3449#L15-1 [59] 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] 3399#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3400#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3393#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3394#L15-1 [59] 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] 3406#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3448#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3447#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3446#L15-1 [59] 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] 3445#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3444#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3443#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3442#L15-1 [59] 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] 3441#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3440#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3439#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3438#L15-1 [59] 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] 3437#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3436#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3435#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3434#L15-1 [59] 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] 3433#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3432#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3431#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3430#L15-1 [59] 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] 3429#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3428#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3427#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3426#L15-1 [59] 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] 3425#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3424#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3423#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3421#L15-1 [59] 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] 3419#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3416#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3417#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3414#L15-1 79.21/40.84 [2019-03-28 22:38:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 8 times 79.21/40.84 [2019-03-28 22:38:52,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -478609250, now seen corresponding path program 9 times 79.21/40.84 [2019-03-28 22:38:52,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:52,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:52,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:52,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:52,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 79.21/40.84 [2019-03-28 22:38:52,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:52,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:52,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:52,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 79.21/40.84 [2019-03-28 22:38:52,424 INFO L811 eck$LassoCheckResult]: loop already infeasible 79.21/40.84 [2019-03-28 22:38:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 79.21/40.84 [2019-03-28 22:38:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 79.21/40.84 [2019-03-28 22:38:52,425 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. cyclomatic complexity: 24 Second operand 12 states. 79.21/40.84 [2019-03-28 22:38:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:52,549 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. 79.21/40.84 [2019-03-28 22:38:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 79.21/40.84 [2019-03-28 22:38:52,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 169 transitions. 79.21/40.84 [2019-03-28 22:38:52,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 79.21/40.84 [2019-03-28 22:38:52,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 134 states and 166 transitions. 79.21/40.84 [2019-03-28 22:38:52,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 79.21/40.84 [2019-03-28 22:38:52,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 79.21/40.84 [2019-03-28 22:38:52,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 166 transitions. 79.21/40.84 [2019-03-28 22:38:52,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:52,553 INFO L706 BuchiCegarLoop]: Abstraction has 134 states and 166 transitions. 79.21/40.84 [2019-03-28 22:38:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 166 transitions. 79.21/40.84 [2019-03-28 22:38:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. 79.21/40.84 [2019-03-28 22:38:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.84 [2019-03-28 22:38:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. 79.21/40.84 [2019-03-28 22:38:52,557 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 154 transitions. 79.21/40.84 [2019-03-28 22:38:52,557 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 154 transitions. 79.21/40.84 [2019-03-28 22:38:52,557 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 79.21/40.84 [2019-03-28 22:38:52,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 154 transitions. 79.21/40.84 [2019-03-28 22:38:52,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:52,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:52,558 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:52,559 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:52,559 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:52,559 INFO L794 eck$LassoCheckResult]: Stem: 3749#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] 3750#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3760#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3762#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3763#L15-1 79.21/40.84 [2019-03-28 22:38:52,560 INFO L796 eck$LassoCheckResult]: Loop: 3763#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] 3867#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3752#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 3767#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3807#L15-1 [59] 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] 3806#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3805#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3804#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3803#L15-1 [59] 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] 3802#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3801#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3800#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3799#L15-1 [59] 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] 3798#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3797#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3796#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3795#L15-1 [59] 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] 3794#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3793#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3792#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3791#L15-1 [59] 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] 3790#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3789#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3788#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3787#L15-1 [59] 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] 3786#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3785#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3784#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3783#L15-1 [59] 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] 3782#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3781#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3780#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3779#L15-1 [59] 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] 3778#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3777#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3776#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3775#L15-1 [59] 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] 3774#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3773#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3772#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 3765#L15-1 [59] 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] 3769#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 3766#L12 [56] L12-->L12-2: Formula: (> 10 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[] 3764#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 3763#L15-1 79.21/40.84 [2019-03-28 22:38:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 9 times 79.21/40.84 [2019-03-28 22:38:52,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1997610515, now seen corresponding path program 10 times 79.21/40.84 [2019-03-28 22:38:52,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1556204068, now seen corresponding path program 1 times 79.21/40.84 [2019-03-28 22:38:52,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:52,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:52,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:52,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:52,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 79.21/40.84 [2019-03-28 22:38:52,837 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 79.21/40.84 [2019-03-28 22:38:52,846 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:52,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:52,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:52,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:52,846 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.84 [2019-03-28 22:38:52,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:52,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:52,847 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:52,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 79.21/40.84 [2019-03-28 22:38:52,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:52,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,916 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:52,916 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:52,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:52,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:52,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:52,951 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 [2019-03-28 22:38:52,955 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.84 [2019-03-28 22:38:52,981 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:52,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:52,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:52,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:52,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.84 [2019-03-28 22:38:52,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:52,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:52,982 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:52,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 79.21/40.84 [2019-03-28 22:38:52,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:52,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:52,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:52,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:53,036 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:53,036 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.84 [2019-03-28 22:38:53,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:53,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:53,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:53,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:53,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:53,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:53,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:53,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:53,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.84 [2019-03-28 22:38:53,044 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.84 [2019-03-28 22:38:53,044 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.84 [2019-03-28 22:38:53,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.84 [2019-03-28 22:38:53,045 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.84 [2019-03-28 22:38:53,045 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.84 [2019-03-28 22:38:53,045 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.84 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.84 Supporting invariants [] 79.21/40.84 [2019-03-28 22:38:53,045 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.84 [2019-03-28 22:38:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:53,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,011 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 9 predicates after loop cannibalization 79.21/40.84 [2019-03-28 22:38:54,011 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 9 loop predicates 79.21/40.84 [2019-03-28 22:38:54,011 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 154 transitions. cyclomatic complexity: 33 Second operand 5 states. 79.21/40.84 [2019-03-28 22:38:54,121 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 154 transitions. cyclomatic complexity: 33. Second operand 5 states. Result 450 states and 554 transitions. Complement of second has 28 states. 79.21/40.84 [2019-03-28 22:38:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states 79.21/40.84 [2019-03-28 22:38:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 79.21/40.84 [2019-03-28 22:38:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. 79.21/40.84 [2019-03-28 22:38:54,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 4 letters. Loop has 44 letters. 79.21/40.84 [2019-03-28 22:38:54,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:54,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 48 letters. Loop has 44 letters. 79.21/40.84 [2019-03-28 22:38:54,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:54,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 4 letters. Loop has 88 letters. 79.21/40.84 [2019-03-28 22:38:54,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:54,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 554 transitions. 79.21/40.84 [2019-03-28 22:38:54,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:54,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 128 states and 158 transitions. 79.21/40.84 [2019-03-28 22:38:54,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 79.21/40.84 [2019-03-28 22:38:54,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 79.21/40.84 [2019-03-28 22:38:54,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 158 transitions. 79.21/40.84 [2019-03-28 22:38:54,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:54,134 INFO L706 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. 79.21/40.84 [2019-03-28 22:38:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 158 transitions. 79.21/40.84 [2019-03-28 22:38:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. 79.21/40.84 [2019-03-28 22:38:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.84 [2019-03-28 22:38:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,137 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 79.21/40.84 [2019-03-28 22:38:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 79.21/40.84 [2019-03-28 22:38:54,138 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand 4 states. 79.21/40.84 [2019-03-28 22:38:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:54,161 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 79.21/40.84 [2019-03-28 22:38:54,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:54,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.84 [2019-03-28 22:38:54,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.84 [2019-03-28 22:38:54,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:54,165 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.84 [2019-03-28 22:38:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.84 [2019-03-28 22:38:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,168 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,169 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,169 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 79.21/40.84 [2019-03-28 22:38:54,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 153 transitions. 79.21/40.84 [2019-03-28 22:38:54,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:54,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:54,170 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:54,170 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:54,170 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] 79.21/40.84 [2019-03-28 22:38:54,171 INFO L794 eck$LassoCheckResult]: Stem: 10192#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] 10193#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10201#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10203#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 10204#L15-1 79.21/40.84 [2019-03-28 22:38:54,171 INFO L796 eck$LassoCheckResult]: Loop: 10204#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] 10194#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10195#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10188#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10189#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] 10200#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10278#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 10208#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10277#L15-1 [59] 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] 10276#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10275#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10274#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10273#L15-1 [59] 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] 10272#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10269#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10268#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10266#L15-1 [59] 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] 10264#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10262#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10260#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10258#L15-1 [59] 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] 10256#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10254#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10252#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10250#L15-1 [59] 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] 10248#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10246#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10244#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10242#L15-1 [59] 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] 10240#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10238#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10236#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10234#L15-1 [59] 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] 10232#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10230#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10228#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10226#L15-1 [59] 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] 10224#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10222#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10220#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10218#L15-1 [59] 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] 10216#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10214#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10213#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 10206#L15-1 [59] 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] 10210#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 10207#L12 [56] L12-->L12-2: Formula: (> 10 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[] 10205#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 10204#L15-1 79.21/40.84 [2019-03-28 22:38:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 10 times 79.21/40.84 [2019-03-28 22:38:54,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:54,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -419915894, now seen corresponding path program 11 times 79.21/40.84 [2019-03-28 22:38:54,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:54,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:54,193 INFO L82 PathProgramCache]: Analyzing trace with hash -527541255, now seen corresponding path program 2 times 79.21/40.84 [2019-03-28 22:38:54,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:54,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:54,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:54,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:54,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 79.21/40.84 [2019-03-28 22:38:54,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:54,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:54,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 79.21/40.84 [2019-03-28 22:38:54,509 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 49 79.21/40.84 [2019-03-28 22:38:54,521 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:54,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:54,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:54,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:54,521 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.84 [2019-03-28 22:38:54,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:54,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:54,522 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:54,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 79.21/40.84 [2019-03-28 22:38:54,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:54,522 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:54,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,586 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:54,587 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:54,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:54,593 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 [2019-03-28 22:38:54,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.84 [2019-03-28 22:38:54,597 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:54,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:54,624 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:54,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:54,654 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 [2019-03-28 22:38:54,658 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.84 [2019-03-28 22:38:54,682 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:54,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:54,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:54,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:54,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.84 [2019-03-28 22:38:54,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:54,683 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:54,683 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:54,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 79.21/40.84 [2019-03-28 22:38:54,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:54,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:54,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:54,735 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:54,735 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.84 [2019-03-28 22:38:54,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:54,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:54,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:54,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:54,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:54,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:54,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:54,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:54,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.84 [2019-03-28 22:38:54,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:54,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:54,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:54,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:54,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:54,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:54,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:54,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.84 [2019-03-28 22:38:54,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:54,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:54,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:54,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:54,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:54,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:54,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:54,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.84 [2019-03-28 22:38:54,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.84 [2019-03-28 22:38:54,748 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.84 [2019-03-28 22:38:54,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.84 [2019-03-28 22:38:54,749 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.84 [2019-03-28 22:38:54,749 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.84 [2019-03-28 22:38:54,749 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.84 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.84 Supporting invariants [] 79.21/40.84 [2019-03-28 22:38:54,750 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.84 [2019-03-28 22:38:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:54,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:54,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:55,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:55,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:55,933 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 13 predicates after loop cannibalization 79.21/40.84 [2019-03-28 22:38:55,933 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 13 loop predicates 79.21/40.84 [2019-03-28 22:38:55,934 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 153 transitions. cyclomatic complexity: 32 Second operand 5 states. 79.21/40.84 [2019-03-28 22:38:56,213 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 153 transitions. cyclomatic complexity: 32. Second operand 5 states. Result 482 states and 582 transitions. Complement of second has 44 states. 79.21/40.84 [2019-03-28 22:38:56,214 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 79.21/40.84 [2019-03-28 22:38:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 79.21/40.84 [2019-03-28 22:38:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. 79.21/40.84 [2019-03-28 22:38:56,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 4 letters. Loop has 48 letters. 79.21/40.84 [2019-03-28 22:38:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 52 letters. Loop has 48 letters. 79.21/40.84 [2019-03-28 22:38:56,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:56,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 4 letters. Loop has 96 letters. 79.21/40.84 [2019-03-28 22:38:56,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.84 [2019-03-28 22:38:56,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 582 transitions. 79.21/40.84 [2019-03-28 22:38:56,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:56,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 132 states and 161 transitions. 79.21/40.84 [2019-03-28 22:38:56,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 79.21/40.84 [2019-03-28 22:38:56,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 79.21/40.84 [2019-03-28 22:38:56,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 161 transitions. 79.21/40.84 [2019-03-28 22:38:56,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:56,224 INFO L706 BuchiCegarLoop]: Abstraction has 132 states and 161 transitions. 79.21/40.84 [2019-03-28 22:38:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 161 transitions. 79.21/40.84 [2019-03-28 22:38:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. 79.21/40.84 [2019-03-28 22:38:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.84 [2019-03-28 22:38:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,227 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 79.21/40.84 [2019-03-28 22:38:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 79.21/40.84 [2019-03-28 22:38:56,228 INFO L87 Difference]: Start difference. First operand 123 states and 152 transitions. Second operand 5 states. 79.21/40.84 [2019-03-28 22:38:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.84 [2019-03-28 22:38:56,254 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 79.21/40.84 [2019-03-28 22:38:56,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:56,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.84 [2019-03-28 22:38:56,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.84 [2019-03-28 22:38:56,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.84 [2019-03-28 22:38:56,258 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.84 [2019-03-28 22:38:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.84 [2019-03-28 22:38:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,262 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,262 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,262 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ 79.21/40.84 [2019-03-28 22:38:56,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 152 transitions. 79.21/40.84 [2019-03-28 22:38:56,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.84 [2019-03-28 22:38:56,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.84 [2019-03-28 22:38:56,263 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.84 [2019-03-28 22:38:56,263 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.84 [2019-03-28 22:38:56,263 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] 79.21/40.84 [2019-03-28 22:38:56,264 INFO L794 eck$LassoCheckResult]: Stem: 17935#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] 17936#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17944#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17946#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 17947#L15-1 79.21/40.84 [2019-03-28 22:38:56,264 INFO L796 eck$LassoCheckResult]: Loop: 17947#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] 18023#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 18026#L12 [56] L12-->L12-2: Formula: (> 10 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[] 18024#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 18025#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] 17937#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17938#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17931#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17932#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] 17943#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 18021#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 17951#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 18020#L15-1 [59] 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] 18019#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 18018#L12 [56] L12-->L12-2: Formula: (> 10 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[] 18017#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 18016#L15-1 [59] 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] 18015#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 18012#L12 [56] L12-->L12-2: Formula: (> 10 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[] 18011#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 18009#L15-1 [59] 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] 18007#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 18005#L12 [56] L12-->L12-2: Formula: (> 10 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[] 18003#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 18001#L15-1 [59] 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] 17999#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17997#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17995#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17993#L15-1 [59] 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] 17991#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17989#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17987#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17985#L15-1 [59] 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] 17983#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17981#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17979#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17977#L15-1 [59] 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] 17975#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17973#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17971#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17969#L15-1 [59] 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] 17967#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17965#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17963#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17961#L15-1 [59] 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] 17959#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17957#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17956#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 17949#L15-1 [59] 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] 17953#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 17950#L12 [56] L12-->L12-2: Formula: (> 10 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[] 17948#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 17947#L15-1 79.21/40.84 [2019-03-28 22:38:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:56,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 11 times 79.21/40.84 [2019-03-28 22:38:56,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:56,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 398735015, now seen corresponding path program 12 times 79.21/40.84 [2019-03-28 22:38:56,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.84 [2019-03-28 22:38:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 250882966, now seen corresponding path program 3 times 79.21/40.84 [2019-03-28 22:38:56,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.84 [2019-03-28 22:38:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.84 [2019-03-28 22:38:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.84 [2019-03-28 22:38:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 151 proven. 10 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:56,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.84 [2019-03-28 22:38:56,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.84 [2019-03-28 22:38:56,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 79.21/40.84 [2019-03-28 22:38:56,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) 79.21/40.84 [2019-03-28 22:38:56,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 151 proven. 10 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.84 [2019-03-28 22:38:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 79.21/40.84 [2019-03-28 22:38:56,595 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 51 79.21/40.84 [2019-03-28 22:38:56,603 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:56,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:56,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:56,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:56,603 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.84 [2019-03-28 22:38:56,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:56,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:56,604 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:56,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 79.21/40.84 [2019-03-28 22:38:56,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:56,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:56,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,656 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:56,657 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:56,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:56,660 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 [2019-03-28 22:38:56,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.84 [2019-03-28 22:38:56,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:56,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:56,690 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.84 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.84 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:56,721 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.84 [2019-03-28 22:38:56,721 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.84 [2019-03-28 22:38:56,725 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.84 [2019-03-28 22:38:56,751 INFO L216 LassoAnalysis]: Preferences: 79.21/40.84 [2019-03-28 22:38:56,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.84 [2019-03-28 22:38:56,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.84 [2019-03-28 22:38:56,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.84 [2019-03-28 22:38:56,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.84 [2019-03-28 22:38:56,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.84 [2019-03-28 22:38:56,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.84 [2019-03-28 22:38:56,752 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.84 [2019-03-28 22:38:56,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 79.21/40.84 [2019-03-28 22:38:56,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.84 [2019-03-28 22:38:56,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.84 [2019-03-28 22:38:56,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.84 [2019-03-28 22:38:56,806 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.84 [2019-03-28 22:38:56,806 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.84 [2019-03-28 22:38:56,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:56,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:56,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:56,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:56,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:56,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:56,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:56,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:56,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.84 [2019-03-28 22:38:56,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.84 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.84 Number of strict supporting invariants: 0 79.21/40.84 Number of non-strict supporting invariants: 1 79.21/40.84 Consider only non-deceasing supporting invariants: true 79.21/40.84 Simplify termination arguments: true 79.21/40.84 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.84 [2019-03-28 22:38:56,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.84 [2019-03-28 22:38:56,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.84 [2019-03-28 22:38:56,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.84 [2019-03-28 22:38:56,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.84 [2019-03-28 22:38:56,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.84 [2019-03-28 22:38:56,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.84 [2019-03-28 22:38:56,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.84 [2019-03-28 22:38:56,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.84 [2019-03-28 22:38:56,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.84 [2019-03-28 22:38:56,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.84 [2019-03-28 22:38:56,815 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.84 [2019-03-28 22:38:56,815 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.84 [2019-03-28 22:38:56,815 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.84 [2019-03-28 22:38:56,815 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.84 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.84 Supporting invariants [] 79.21/40.84 [2019-03-28 22:38:56,815 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.84 [2019-03-28 22:38:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.84 [2019-03-28 22:38:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.84 [2019-03-28 22:38:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:56,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:56,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:57,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:57,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.84 [2019-03-28 22:38:58,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core 79.21/40.84 [2019-03-28 22:38:58,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.84 [2019-03-28 22:38:58,241 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 16 predicates after loop cannibalization 79.21/40.84 [2019-03-28 22:38:58,242 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 16 loop predicates 79.21/40.84 [2019-03-28 22:38:58,242 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 152 transitions. cyclomatic complexity: 31 Second operand 6 states. 79.21/40.84 [2019-03-28 22:38:58,545 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 152 transitions. cyclomatic complexity: 31. Second operand 6 states. Result 514 states and 610 transitions. Complement of second has 56 states. 79.21/40.85 [2019-03-28 22:38:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states 79.21/40.85 [2019-03-28 22:38:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 79.21/40.85 [2019-03-28 22:38:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. 79.21/40.85 [2019-03-28 22:38:58,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 52 letters. 79.21/40.85 [2019-03-28 22:38:58,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:38:58,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 56 letters. Loop has 52 letters. 79.21/40.85 [2019-03-28 22:38:58,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:38:58,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 104 letters. 79.21/40.85 [2019-03-28 22:38:58,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:38:58,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 610 transitions. 79.21/40.85 [2019-03-28 22:38:58,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:38:58,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 136 states and 164 transitions. 79.21/40.85 [2019-03-28 22:38:58,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 79.21/40.85 [2019-03-28 22:38:58,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 79.21/40.85 [2019-03-28 22:38:58,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 164 transitions. 79.21/40.85 [2019-03-28 22:38:58,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:38:58,558 INFO L706 BuchiCegarLoop]: Abstraction has 136 states and 164 transitions. 79.21/40.85 [2019-03-28 22:38:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 164 transitions. 79.21/40.85 [2019-03-28 22:38:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. 79.21/40.85 [2019-03-28 22:38:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:38:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,561 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 79.21/40.85 [2019-03-28 22:38:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 79.21/40.85 [2019-03-28 22:38:58,562 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand 6 states. 79.21/40.85 [2019-03-28 22:38:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.85 [2019-03-28 22:38:58,591 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 79.21/40.85 [2019-03-28 22:38:58,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:38:58,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.85 [2019-03-28 22:38:58,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.85 [2019-03-28 22:38:58,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:38:58,595 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.85 [2019-03-28 22:38:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:38:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,598 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,598 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,598 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ 79.21/40.85 [2019-03-28 22:38:58,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 151 transitions. 79.21/40.85 [2019-03-28 22:38:58,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:38:58,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.85 [2019-03-28 22:38:58,599 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.85 [2019-03-28 22:38:58,600 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.85 [2019-03-28 22:38:58,600 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] 79.21/40.85 [2019-03-28 22:38:58,600 INFO L794 eck$LassoCheckResult]: Stem: 26923#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] 26924#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26934#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26935#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 26936#L15-1 79.21/40.85 [2019-03-28 22:38:58,601 INFO L796 eck$LassoCheckResult]: Loop: 26936#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] 27012#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 27017#L12 [56] L12-->L12-2: Formula: (> 10 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[] 27013#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 27014#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] 27019#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 27015#L12 [56] L12-->L12-2: Formula: (> 10 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[] 27016#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 27018#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] 26925#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26926#L12 [56] L12-->L12-2: Formula: (> 10 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[] 27041#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 27040#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] 27020#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 27010#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 26940#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 27009#L15-1 [59] 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] 27008#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 27007#L12 [56] L12-->L12-2: Formula: (> 10 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[] 27006#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 27005#L15-1 [59] 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] 27004#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 27001#L12 [56] L12-->L12-2: Formula: (> 10 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[] 27000#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26998#L15-1 [59] 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] 26996#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26994#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26992#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26990#L15-1 [59] 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] 26988#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26986#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26984#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26982#L15-1 [59] 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] 26980#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26978#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26976#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26974#L15-1 [59] 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] 26972#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26970#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26968#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26966#L15-1 [59] 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] 26964#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26962#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26960#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26958#L15-1 [59] 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] 26956#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26954#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26952#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26950#L15-1 [59] 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] 26948#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26946#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26945#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 26938#L15-1 [59] 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] 26942#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 26939#L12 [56] L12-->L12-2: Formula: (> 10 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[] 26937#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 26936#L15-1 79.21/40.85 [2019-03-28 22:38:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:38:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 12 times 79.21/40.85 [2019-03-28 22:38:58,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:38:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:38:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:38:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:38:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:38:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1388249276, now seen corresponding path program 13 times 79.21/40.85 [2019-03-28 22:38:58,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:38:58,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:38:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:38:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:38:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:38:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash -260119373, now seen corresponding path program 4 times 79.21/40.85 [2019-03-28 22:38:58,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:38:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:38:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:38:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 195 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:38:58,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.85 [2019-03-28 22:38:58,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.85 [2019-03-28 22:38:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 79.21/40.85 [2019-03-28 22:38:58,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 79.21/40.85 [2019-03-28 22:38:58,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:58,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:58,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 195 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:38:58,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.85 [2019-03-28 22:38:58,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 79.21/40.85 [2019-03-28 22:38:59,034 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 79.21/40.85 [2019-03-28 22:38:59,043 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:38:59,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:38:59,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:38:59,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:38:59,043 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.85 [2019-03-28 22:38:59,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:38:59,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:38:59,043 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:38:59,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop 79.21/40.85 [2019-03-28 22:38:59,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:38:59,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:38:59,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,095 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:38:59,095 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:38:59,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:38:59,098 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:38:59,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.85 [2019-03-28 22:38:59,125 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: [] 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 [2019-03-28 22:38:59,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:38:59,130 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:38:59,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.85 [2019-03-28 22:38:59,161 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:38:59,166 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.85 [2019-03-28 22:38:59,189 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:38:59,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:38:59,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:38:59,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:38:59,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.85 [2019-03-28 22:38:59,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:38:59,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:38:59,190 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:38:59,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop 79.21/40.85 [2019-03-28 22:38:59,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:38:59,191 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:38:59,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:38:59,241 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:38:59,241 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.85 [2019-03-28 22:38:59,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:38:59,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:38:59,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:38:59,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:38:59,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:38:59,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:38:59,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.85 [2019-03-28 22:38:59,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.85 [2019-03-28 22:38:59,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:38:59,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:38:59,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:38:59,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:38:59,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:38:59,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:38:59,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.85 [2019-03-28 22:38:59,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.85 [2019-03-28 22:38:59,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:38:59,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:38:59,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.85 [2019-03-28 22:38:59,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:38:59,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:38:59,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:38:59,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:38:59,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.85 [2019-03-28 22:38:59,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.85 [2019-03-28 22:38:59,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.85 [2019-03-28 22:38:59,254 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.85 [2019-03-28 22:38:59,255 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.85 [2019-03-28 22:38:59,255 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.85 [2019-03-28 22:38:59,255 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.85 [2019-03-28 22:38:59,255 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.85 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.85 Supporting invariants [] 79.21/40.85 [2019-03-28 22:38:59,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.85 [2019-03-28 22:38:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:38:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:38:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:38:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:38:59,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:38:59,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:00,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:00,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:00,997 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 19 predicates after loop cannibalization 79.21/40.85 [2019-03-28 22:39:00,997 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 19 loop predicates 79.21/40.85 [2019-03-28 22:39:00,998 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 151 transitions. cyclomatic complexity: 30 Second operand 7 states. 79.21/40.85 [2019-03-28 22:39:01,401 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 151 transitions. cyclomatic complexity: 30. Second operand 7 states. Result 546 states and 638 transitions. Complement of second has 68 states. 79.21/40.85 [2019-03-28 22:39:01,401 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 79.21/40.85 [2019-03-28 22:39:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 79.21/40.85 [2019-03-28 22:39:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. 79.21/40.85 [2019-03-28 22:39:01,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 4 letters. Loop has 56 letters. 79.21/40.85 [2019-03-28 22:39:01,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:01,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 60 letters. Loop has 56 letters. 79.21/40.85 [2019-03-28 22:39:01,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:01,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 4 letters. Loop has 112 letters. 79.21/40.85 [2019-03-28 22:39:01,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:01,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 638 transitions. 79.21/40.85 [2019-03-28 22:39:01,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:01,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 140 states and 167 transitions. 79.21/40.85 [2019-03-28 22:39:01,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 79.21/40.85 [2019-03-28 22:39:01,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 79.21/40.85 [2019-03-28 22:39:01,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 167 transitions. 79.21/40.85 [2019-03-28 22:39:01,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:01,410 INFO L706 BuchiCegarLoop]: Abstraction has 140 states and 167 transitions. 79.21/40.85 [2019-03-28 22:39:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 167 transitions. 79.21/40.85 [2019-03-28 22:39:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. 79.21/40.85 [2019-03-28 22:39:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,413 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 79.21/40.85 [2019-03-28 22:39:01,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 79.21/40.85 [2019-03-28 22:39:01,414 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 7 states. 79.21/40.85 [2019-03-28 22:39:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.85 [2019-03-28 22:39:01,461 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 79.21/40.85 [2019-03-28 22:39:01,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:01,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:01,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:01,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:01,464 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.85 [2019-03-28 22:39:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,467 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,468 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,468 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ 79.21/40.85 [2019-03-28 22:39:01,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 150 transitions. 79.21/40.85 [2019-03-28 22:39:01,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:01,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.85 [2019-03-28 22:39:01,469 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.85 [2019-03-28 22:39:01,469 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.85 [2019-03-28 22:39:01,469 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] 79.21/40.85 [2019-03-28 22:39:01,470 INFO L794 eck$LassoCheckResult]: Stem: 37253#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] 37254#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37264#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37265#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 37266#L15-1 79.21/40.85 [2019-03-28 22:39:01,470 INFO L796 eck$LassoCheckResult]: Loop: 37266#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] 37342#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37347#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37343#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37344#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] 37353#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37345#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37346#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37352#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] 37351#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37350#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37349#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37348#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] 37255#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37256#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37371#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37370#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] 37354#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37340#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 37270#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37339#L15-1 [59] 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] 37338#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37337#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37336#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37335#L15-1 [59] 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] 37334#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37331#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37330#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37328#L15-1 [59] 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] 37326#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37324#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37322#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37320#L15-1 [59] 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] 37318#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37316#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37314#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37312#L15-1 [59] 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] 37310#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37308#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37306#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37304#L15-1 [59] 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] 37302#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37300#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37298#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37296#L15-1 [59] 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] 37294#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37292#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37290#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37288#L15-1 [59] 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] 37286#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37284#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37282#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37280#L15-1 [59] 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] 37278#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37276#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37275#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 37268#L15-1 [59] 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] 37272#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 37269#L12 [56] L12-->L12-2: Formula: (> 10 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[] 37267#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 37266#L15-1 79.21/40.85 [2019-03-28 22:39:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 13 times 79.21/40.85 [2019-03-28 22:39:01,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 800993633, now seen corresponding path program 14 times 79.21/40.85 [2019-03-28 22:39:01,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 765314896, now seen corresponding path program 5 times 79.21/40.85 [2019-03-28 22:39:01,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:01,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 239 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:01,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.85 [2019-03-28 22:39:01,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.85 [2019-03-28 22:39:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 79.21/40.85 [2019-03-28 22:39:01,595 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) 79.21/40.85 [2019-03-28 22:39:01,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:01,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:01,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 239 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.85 [2019-03-28 22:39:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 79.21/40.85 [2019-03-28 22:39:01,894 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 57 79.21/40.85 [2019-03-28 22:39:01,902 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:01,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:01,902 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:01,902 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:01,902 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.85 [2019-03-28 22:39:01,902 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:01,902 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:01,903 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:01,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop 79.21/40.85 [2019-03-28 22:39:01,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:01,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:01,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:01,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:01,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:01,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:01,954 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:01,954 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:01,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:01,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:01,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.85 [2019-03-28 22:39:01,985 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: [] 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:01,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:01,989 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:02,016 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.85 [2019-03-28 22:39:02,018 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: [] 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:02,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:02,023 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:02,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:02,053 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:02,057 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.85 [2019-03-28 22:39:02,080 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:02,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:02,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:02,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:02,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.85 [2019-03-28 22:39:02,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:02,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:02,081 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:02,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop 79.21/40.85 [2019-03-28 22:39:02,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:02,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:02,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:02,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:02,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:02,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:02,132 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:02,132 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.85 [2019-03-28 22:39:02,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:39:02,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:39:02,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:39:02,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:39:02,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:39:02,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:39:02,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.85 [2019-03-28 22:39:02,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.85 [2019-03-28 22:39:02,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:39:02,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:39:02,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.85 [2019-03-28 22:39:02,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:39:02,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:39:02,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:39:02,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:39:02,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.85 [2019-03-28 22:39:02,140 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.85 [2019-03-28 22:39:02,141 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.85 [2019-03-28 22:39:02,141 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.85 [2019-03-28 22:39:02,141 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.85 [2019-03-28 22:39:02,141 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.85 [2019-03-28 22:39:02,142 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.85 [2019-03-28 22:39:02,142 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.85 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.85 Supporting invariants [] 79.21/40.85 [2019-03-28 22:39:02,142 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.85 [2019-03-28 22:39:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:02,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:02,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:03,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:03,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:04,003 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 22 predicates after loop cannibalization 79.21/40.85 [2019-03-28 22:39:04,003 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 22 loop predicates 79.21/40.85 [2019-03-28 22:39:04,003 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 150 transitions. cyclomatic complexity: 29 Second operand 8 states. 79.21/40.85 [2019-03-28 22:39:04,666 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 150 transitions. cyclomatic complexity: 29. Second operand 8 states. Result 578 states and 666 transitions. Complement of second has 80 states. 79.21/40.85 [2019-03-28 22:39:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 1 accepting loop states 79.21/40.85 [2019-03-28 22:39:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 79.21/40.85 [2019-03-28 22:39:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. 79.21/40.85 [2019-03-28 22:39:04,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 4 letters. Loop has 60 letters. 79.21/40.85 [2019-03-28 22:39:04,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:04,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 64 letters. Loop has 60 letters. 79.21/40.85 [2019-03-28 22:39:04,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:04,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 4 letters. Loop has 120 letters. 79.21/40.85 [2019-03-28 22:39:04,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:04,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 666 transitions. 79.21/40.85 [2019-03-28 22:39:04,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:04,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 144 states and 170 transitions. 79.21/40.85 [2019-03-28 22:39:04,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 79.21/40.85 [2019-03-28 22:39:04,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 79.21/40.85 [2019-03-28 22:39:04,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. 79.21/40.85 [2019-03-28 22:39:04,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:04,677 INFO L706 BuchiCegarLoop]: Abstraction has 144 states and 170 transitions. 79.21/40.85 [2019-03-28 22:39:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. 79.21/40.85 [2019-03-28 22:39:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. 79.21/40.85 [2019-03-28 22:39:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,680 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 79.21/40.85 [2019-03-28 22:39:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 79.21/40.85 [2019-03-28 22:39:04,680 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 8 states. 79.21/40.85 [2019-03-28 22:39:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.85 [2019-03-28 22:39:04,739 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 79.21/40.85 [2019-03-28 22:39:04,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:04,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:04,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:04,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:04,743 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.85 [2019-03-28 22:39:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,746 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,746 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,746 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ 79.21/40.85 [2019-03-28 22:39:04,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 149 transitions. 79.21/40.85 [2019-03-28 22:39:04,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:04,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.85 [2019-03-28 22:39:04,747 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.85 [2019-03-28 22:39:04,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.85 [2019-03-28 22:39:04,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] 79.21/40.85 [2019-03-28 22:39:04,748 INFO L794 eck$LassoCheckResult]: Stem: 49022#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] 49023#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49033#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49035#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 49036#L15-1 79.21/40.85 [2019-03-28 22:39:04,749 INFO L796 eck$LassoCheckResult]: Loop: 49036#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] 49115#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49114#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49018#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49019#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] 49032#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49126#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49125#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49124#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] 49123#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49122#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49121#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49120#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] 49119#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49118#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49117#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49116#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] 49024#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49025#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49140#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49139#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] 49127#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49110#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 49040#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49109#L15-1 [59] 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] 49108#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49107#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49106#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49105#L15-1 [59] 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] 49104#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49101#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49100#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49098#L15-1 [59] 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] 49096#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49094#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49092#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49090#L15-1 [59] 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] 49088#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49086#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49084#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49082#L15-1 [59] 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] 49080#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49078#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49076#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49074#L15-1 [59] 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] 49072#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49070#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49068#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49066#L15-1 [59] 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] 49064#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49062#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49060#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49058#L15-1 [59] 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] 49056#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49054#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49052#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49050#L15-1 [59] 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] 49048#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49046#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49045#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 49038#L15-1 [59] 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] 49042#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 49039#L12 [56] L12-->L12-2: Formula: (> 10 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[] 49037#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 49036#L15-1 79.21/40.85 [2019-03-28 22:39:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 14 times 79.21/40.85 [2019-03-28 22:39:04,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:04,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:04,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash -303362818, now seen corresponding path program 15 times 79.21/40.85 [2019-03-28 22:39:04,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:04,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash 622859117, now seen corresponding path program 6 times 79.21/40.85 [2019-03-28 22:39:04,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:04,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.85 [2019-03-28 22:39:04,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.85 [2019-03-28 22:39:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 79.21/40.85 [2019-03-28 22:39:04,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) 79.21/40.85 [2019-03-28 22:39:04,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:04,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:04,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.85 [2019-03-28 22:39:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 79.21/40.85 [2019-03-28 22:39:05,268 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 60 79.21/40.85 [2019-03-28 22:39:05,275 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:05,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:05,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:05,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:05,276 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.85 [2019-03-28 22:39:05,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:05,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:05,276 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:05,276 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop 79.21/40.85 [2019-03-28 22:39:05,276 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:05,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:05,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,334 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:05,334 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:05,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:05,343 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:05,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.85 [2019-03-28 22:39:05,370 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: [] 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:05,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:05,374 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:05,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:05,404 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:05,409 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.85 [2019-03-28 22:39:05,433 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:05,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:05,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:05,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:05,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.85 [2019-03-28 22:39:05,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:05,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:05,434 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:05,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop 79.21/40.85 [2019-03-28 22:39:05,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:05,435 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:05,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:05,488 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:05,488 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.85 [2019-03-28 22:39:05,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:39:05,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:39:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:39:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:39:05,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:39:05,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:39:05,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.85 [2019-03-28 22:39:05,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.85 [2019-03-28 22:39:05,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:39:05,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:39:05,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.85 [2019-03-28 22:39:05,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:39:05,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:39:05,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:39:05,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:39:05,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.85 [2019-03-28 22:39:05,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.85 [2019-03-28 22:39:05,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.85 [2019-03-28 22:39:05,497 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.85 [2019-03-28 22:39:05,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.85 [2019-03-28 22:39:05,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.85 [2019-03-28 22:39:05,498 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.85 [2019-03-28 22:39:05,498 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.85 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.85 Supporting invariants [] 79.21/40.85 [2019-03-28 22:39:05,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.85 [2019-03-28 22:39:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:05,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:05,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:06,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:06,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:07,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:07,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:07,674 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 25 predicates after loop cannibalization 79.21/40.85 [2019-03-28 22:39:07,674 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 25 loop predicates 79.21/40.85 [2019-03-28 22:39:07,674 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 149 transitions. cyclomatic complexity: 28 Second operand 9 states. 79.21/40.85 [2019-03-28 22:39:08,306 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 149 transitions. cyclomatic complexity: 28. Second operand 9 states. Result 610 states and 694 transitions. Complement of second has 92 states. 79.21/40.85 [2019-03-28 22:39:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 16 non-accepting loop states 1 accepting loop states 79.21/40.85 [2019-03-28 22:39:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 79.21/40.85 [2019-03-28 22:39:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. 79.21/40.85 [2019-03-28 22:39:08,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 4 letters. Loop has 64 letters. 79.21/40.85 [2019-03-28 22:39:08,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:08,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 68 letters. Loop has 64 letters. 79.21/40.85 [2019-03-28 22:39:08,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:08,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 4 letters. Loop has 128 letters. 79.21/40.85 [2019-03-28 22:39:08,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:08,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 694 transitions. 79.21/40.85 [2019-03-28 22:39:08,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:08,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 148 states and 173 transitions. 79.21/40.85 [2019-03-28 22:39:08,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 79.21/40.85 [2019-03-28 22:39:08,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 79.21/40.85 [2019-03-28 22:39:08,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 173 transitions. 79.21/40.85 [2019-03-28 22:39:08,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:08,316 INFO L706 BuchiCegarLoop]: Abstraction has 148 states and 173 transitions. 79.21/40.85 [2019-03-28 22:39:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 173 transitions. 79.21/40.85 [2019-03-28 22:39:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 123. 79.21/40.85 [2019-03-28 22:39:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,319 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 79.21/40.85 [2019-03-28 22:39:08,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 79.21/40.85 [2019-03-28 22:39:08,319 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 9 states. 79.21/40.85 [2019-03-28 22:39:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.85 [2019-03-28 22:39:08,379 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 79.21/40.85 [2019-03-28 22:39:08,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:08,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:08,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:08,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:08,383 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.85 [2019-03-28 22:39:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,386 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,386 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,386 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ 79.21/40.85 [2019-03-28 22:39:08,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 148 transitions. 79.21/40.85 [2019-03-28 22:39:08,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:08,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.85 [2019-03-28 22:39:08,387 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.85 [2019-03-28 22:39:08,387 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.85 [2019-03-28 22:39:08,387 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] 79.21/40.85 [2019-03-28 22:39:08,388 INFO L794 eck$LassoCheckResult]: Stem: 62327#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] 62328#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62336#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62338#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 62339#L15-1 79.21/40.85 [2019-03-28 22:39:08,389 INFO L796 eck$LassoCheckResult]: Loop: 62339#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] 62445#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62333#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62323#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62324#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] 62329#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62330#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62444#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62443#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] 62442#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62441#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62440#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62439#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] 62437#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62435#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62433#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62431#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] 62429#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62427#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62425#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62423#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] 62420#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62421#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62417#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62415#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] 62416#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62413#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 62343#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62412#L15-1 [59] 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] 62411#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62410#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62409#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62408#L15-1 [59] 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] 62407#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62404#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62403#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62401#L15-1 [59] 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] 62399#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62397#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62395#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62393#L15-1 [59] 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] 62391#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62389#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62387#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62385#L15-1 [59] 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] 62383#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62381#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62379#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62377#L15-1 [59] 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] 62375#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62373#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62371#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62369#L15-1 [59] 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] 62367#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62365#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62363#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62361#L15-1 [59] 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] 62359#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62357#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62355#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62353#L15-1 [59] 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] 62351#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62349#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62348#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 62341#L15-1 [59] 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] 62345#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 62342#L12 [56] L12-->L12-2: Formula: (> 10 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[] 62340#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 62339#L15-1 79.21/40.85 [2019-03-28 22:39:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 15 times 79.21/40.85 [2019-03-28 22:39:08,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -858336741, now seen corresponding path program 16 times 79.21/40.85 [2019-03-28 22:39:08,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:08,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1137374966, now seen corresponding path program 7 times 79.21/40.85 [2019-03-28 22:39:08,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:08,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 327 proven. 78 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:08,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.85 [2019-03-28 22:39:08,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.85 [2019-03-28 22:39:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:08,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 327 proven. 78 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:08,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.85 [2019-03-28 22:39:08,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 79.21/40.85 [2019-03-28 22:39:08,900 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 63 79.21/40.85 [2019-03-28 22:39:08,907 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:08,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:08,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:08,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:08,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.85 [2019-03-28 22:39:08,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:08,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:08,908 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:08,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop 79.21/40.85 [2019-03-28 22:39:08,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:08,908 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:08,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:08,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:08,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:08,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:08,956 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:08,956 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:08,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:08,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.85 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.85 Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:08,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.85 [2019-03-28 22:39:08,989 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.85 [2019-03-28 22:39:08,993 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.85 [2019-03-28 22:39:09,016 INFO L216 LassoAnalysis]: Preferences: 79.21/40.85 [2019-03-28 22:39:09,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.85 [2019-03-28 22:39:09,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.85 [2019-03-28 22:39:09,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.85 [2019-03-28 22:39:09,017 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.85 [2019-03-28 22:39:09,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.85 [2019-03-28 22:39:09,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.85 [2019-03-28 22:39:09,017 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.85 [2019-03-28 22:39:09,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop 79.21/40.85 [2019-03-28 22:39:09,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.85 [2019-03-28 22:39:09,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.85 [2019-03-28 22:39:09,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:09,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:09,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:09,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.85 [2019-03-28 22:39:09,067 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.85 [2019-03-28 22:39:09,067 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.85 [2019-03-28 22:39:09,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.85 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.85 Number of strict supporting invariants: 0 79.21/40.85 Number of non-strict supporting invariants: 1 79.21/40.85 Consider only non-deceasing supporting invariants: true 79.21/40.85 Simplify termination arguments: true 79.21/40.85 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.85 [2019-03-28 22:39:09,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.85 [2019-03-28 22:39:09,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.85 [2019-03-28 22:39:09,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.85 [2019-03-28 22:39:09,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.85 [2019-03-28 22:39:09,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.85 [2019-03-28 22:39:09,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.85 [2019-03-28 22:39:09,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.85 [2019-03-28 22:39:09,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.85 [2019-03-28 22:39:09,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.85 [2019-03-28 22:39:09,072 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.85 [2019-03-28 22:39:09,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.85 [2019-03-28 22:39:09,072 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.85 [2019-03-28 22:39:09,072 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.85 [2019-03-28 22:39:09,073 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.85 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.85 Supporting invariants [] 79.21/40.85 [2019-03-28 22:39:09,073 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.85 [2019-03-28 22:39:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:09,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:09,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:10,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:10,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:11,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core 79.21/40.85 [2019-03-28 22:39:11,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.85 [2019-03-28 22:39:11,619 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 28 predicates after loop cannibalization 79.21/40.85 [2019-03-28 22:39:11,619 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 28 loop predicates 79.21/40.85 [2019-03-28 22:39:11,619 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 148 transitions. cyclomatic complexity: 27 Second operand 10 states. 79.21/40.85 [2019-03-28 22:39:12,363 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 148 transitions. cyclomatic complexity: 27. Second operand 10 states. Result 642 states and 722 transitions. Complement of second has 104 states. 79.21/40.85 [2019-03-28 22:39:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 18 non-accepting loop states 1 accepting loop states 79.21/40.85 [2019-03-28 22:39:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 79.21/40.85 [2019-03-28 22:39:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. 79.21/40.85 [2019-03-28 22:39:12,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 4 letters. Loop has 68 letters. 79.21/40.85 [2019-03-28 22:39:12,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:12,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 72 letters. Loop has 68 letters. 79.21/40.85 [2019-03-28 22:39:12,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:12,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 4 letters. Loop has 136 letters. 79.21/40.85 [2019-03-28 22:39:12,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.85 [2019-03-28 22:39:12,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 642 states and 722 transitions. 79.21/40.85 [2019-03-28 22:39:12,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:12,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 642 states to 152 states and 176 transitions. 79.21/40.85 [2019-03-28 22:39:12,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 79.21/40.85 [2019-03-28 22:39:12,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 79.21/40.85 [2019-03-28 22:39:12,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 176 transitions. 79.21/40.85 [2019-03-28 22:39:12,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:12,374 INFO L706 BuchiCegarLoop]: Abstraction has 152 states and 176 transitions. 79.21/40.85 [2019-03-28 22:39:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 176 transitions. 79.21/40.85 [2019-03-28 22:39:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. 79.21/40.85 [2019-03-28 22:39:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,376 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 79.21/40.85 [2019-03-28 22:39:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 79.21/40.85 [2019-03-28 22:39:12,377 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 10 states. 79.21/40.85 [2019-03-28 22:39:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.85 [2019-03-28 22:39:12,450 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 79.21/40.85 [2019-03-28 22:39:12,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:12,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:12,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.85 [2019-03-28 22:39:12,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.85 [2019-03-28 22:39:12,454 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.85 [2019-03-28 22:39:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.85 [2019-03-28 22:39:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,457 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,457 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,457 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ 79.21/40.85 [2019-03-28 22:39:12,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 147 transitions. 79.21/40.85 [2019-03-28 22:39:12,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.85 [2019-03-28 22:39:12,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.85 [2019-03-28 22:39:12,458 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.85 [2019-03-28 22:39:12,458 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.85 [2019-03-28 22:39:12,458 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] 79.21/40.85 [2019-03-28 22:39:12,459 INFO L794 eck$LassoCheckResult]: Stem: 77265#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] 77266#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77274#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77276#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 77273#L15-1 79.21/40.85 [2019-03-28 22:39:12,460 INFO L796 eck$LassoCheckResult]: Loop: 77273#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] 77267#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77268#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77261#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77262#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] 77383#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77382#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77381#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77380#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] 77379#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77378#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77377#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77376#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] 77375#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77374#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77373#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77372#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] 77371#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77370#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77369#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77368#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] 77366#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77364#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77362#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77360#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] 77357#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77358#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77354#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77352#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] 77353#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77350#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 77280#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77349#L15-1 [59] 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] 77348#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77347#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77346#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77345#L15-1 [59] 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] 77344#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77341#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77340#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77338#L15-1 [59] 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] 77336#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77334#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77332#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77330#L15-1 [59] 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] 77328#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77326#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77324#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77322#L15-1 [59] 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] 77320#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77318#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77316#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77314#L15-1 [59] 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] 77312#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77310#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77308#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77306#L15-1 [59] 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] 77304#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77302#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77300#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77298#L15-1 [59] 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] 77296#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77294#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77292#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77290#L15-1 [59] 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] 77288#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77286#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77285#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 77278#L15-1 [59] 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] 77282#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 77279#L12 [56] L12-->L12-2: Formula: (> 10 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[] 77277#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 77273#L15-1 79.21/40.85 [2019-03-28 22:39:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 16 times 79.21/40.85 [2019-03-28 22:39:12,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 401653944, now seen corresponding path program 17 times 79.21/40.85 [2019-03-28 22:39:12,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:12,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.85 [2019-03-28 22:39:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.85 [2019-03-28 22:39:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 778823719, now seen corresponding path program 8 times 79.21/40.85 [2019-03-28 22:39:12,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.85 [2019-03-28 22:39:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.85 [2019-03-28 22:39:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.85 [2019-03-28 22:39:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.85 [2019-03-28 22:39:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 371 proven. 105 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.85 [2019-03-28 22:39:12,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.85 [2019-03-28 22:39:12,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.86 [2019-03-28 22:39:12,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 79.21/40.86 [2019-03-28 22:39:12,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 79.21/40.86 [2019-03-28 22:39:12,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:12,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:12,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 371 proven. 105 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.86 [2019-03-28 22:39:12,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.86 [2019-03-28 22:39:12,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 79.21/40.86 [2019-03-28 22:39:12,949 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 67 79.21/40.86 [2019-03-28 22:39:12,957 INFO L216 LassoAnalysis]: Preferences: 79.21/40.86 [2019-03-28 22:39:12,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.86 [2019-03-28 22:39:12,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.86 [2019-03-28 22:39:12,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.86 [2019-03-28 22:39:12,957 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.86 [2019-03-28 22:39:12,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:12,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.86 [2019-03-28 22:39:12,958 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.86 [2019-03-28 22:39:12,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Loop 79.21/40.86 [2019-03-28 22:39:12,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.86 [2019-03-28 22:39:12,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.86 [2019-03-28 22:39:12,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:12,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:12,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:12,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:13,007 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.86 [2019-03-28 22:39:13,007 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:13,011 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 [2019-03-28 22:39:13,038 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.86 [2019-03-28 22:39:13,038 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: [] 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:13,042 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 [2019-03-28 22:39:13,046 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.86 [2019-03-28 22:39:13,046 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:13,072 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 [2019-03-28 22:39:13,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. 79.21/40.86 [2019-03-28 22:39:13,098 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_21=1} Honda state: {v_rep~unnamed0~0~true_21=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:13,103 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:13,132 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 [2019-03-28 22:39:13,136 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.86 [2019-03-28 22:39:13,159 INFO L216 LassoAnalysis]: Preferences: 79.21/40.86 [2019-03-28 22:39:13,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.86 [2019-03-28 22:39:13,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.86 [2019-03-28 22:39:13,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.86 [2019-03-28 22:39:13,160 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.86 [2019-03-28 22:39:13,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:13,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.86 [2019-03-28 22:39:13,160 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.86 [2019-03-28 22:39:13,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Loop 79.21/40.86 [2019-03-28 22:39:13,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.86 [2019-03-28 22:39:13,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.86 [2019-03-28 22:39:13,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:13,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:13,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:13,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:13,216 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.86 [2019-03-28 22:39:13,217 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.86 [2019-03-28 22:39:13,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.86 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.86 Number of strict supporting invariants: 0 79.21/40.86 Number of non-strict supporting invariants: 1 79.21/40.86 Consider only non-deceasing supporting invariants: true 79.21/40.86 Simplify termination arguments: true 79.21/40.86 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.86 [2019-03-28 22:39:13,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.86 [2019-03-28 22:39:13,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.86 [2019-03-28 22:39:13,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.86 [2019-03-28 22:39:13,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.86 [2019-03-28 22:39:13,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.86 [2019-03-28 22:39:13,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.86 [2019-03-28 22:39:13,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.86 [2019-03-28 22:39:13,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.86 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.86 Number of strict supporting invariants: 0 79.21/40.86 Number of non-strict supporting invariants: 1 79.21/40.86 Consider only non-deceasing supporting invariants: true 79.21/40.86 Simplify termination arguments: true 79.21/40.86 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.86 [2019-03-28 22:39:13,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.86 [2019-03-28 22:39:13,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.86 [2019-03-28 22:39:13,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.86 [2019-03-28 22:39:13,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.86 [2019-03-28 22:39:13,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 79.21/40.86 [2019-03-28 22:39:13,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 79.21/40.86 [2019-03-28 22:39:13,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.86 [2019-03-28 22:39:13,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.86 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.86 Number of strict supporting invariants: 0 79.21/40.86 Number of non-strict supporting invariants: 1 79.21/40.86 Consider only non-deceasing supporting invariants: true 79.21/40.86 Simplify termination arguments: true 79.21/40.86 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.86 [2019-03-28 22:39:13,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.86 [2019-03-28 22:39:13,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.86 [2019-03-28 22:39:13,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.86 [2019-03-28 22:39:13,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.86 [2019-03-28 22:39:13,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.86 [2019-03-28 22:39:13,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.86 [2019-03-28 22:39:13,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.86 [2019-03-28 22:39:13,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 79.21/40.86 [2019-03-28 22:39:13,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.86 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.86 Number of strict supporting invariants: 0 79.21/40.86 Number of non-strict supporting invariants: 1 79.21/40.86 Consider only non-deceasing supporting invariants: true 79.21/40.86 Simplify termination arguments: true 79.21/40.86 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.86 [2019-03-28 22:39:13,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.86 [2019-03-28 22:39:13,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.86 [2019-03-28 22:39:13,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.86 [2019-03-28 22:39:13,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.86 [2019-03-28 22:39:13,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.86 [2019-03-28 22:39:13,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.86 [2019-03-28 22:39:13,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.86 [2019-03-28 22:39:13,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.86 [2019-03-28 22:39:13,230 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.86 [2019-03-28 22:39:13,230 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.86 [2019-03-28 22:39:13,230 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.86 [2019-03-28 22:39:13,230 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.86 [2019-03-28 22:39:13,231 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.86 [2019-03-28 22:39:13,231 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.86 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.86 Supporting invariants [] 79.21/40.86 [2019-03-28 22:39:13,231 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.86 [2019-03-28 22:39:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.86 [2019-03-28 22:39:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:13,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:13,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:14,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:14,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:15,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:16,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:16,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:16,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:16,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:16,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:16,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:16,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:16,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:16,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:16,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:16,329 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 31 predicates after loop cannibalization 79.21/40.86 [2019-03-28 22:39:16,330 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 79.21/40.86 [2019-03-28 22:39:16,330 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 147 transitions. cyclomatic complexity: 26 Second operand 11 states. 79.21/40.86 [2019-03-28 22:39:17,204 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 147 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 674 states and 750 transitions. Complement of second has 116 states. 79.21/40.86 [2019-03-28 22:39:17,204 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 79.21/40.86 [2019-03-28 22:39:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 79.21/40.86 [2019-03-28 22:39:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. 79.21/40.86 [2019-03-28 22:39:17,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 4 letters. Loop has 72 letters. 79.21/40.86 [2019-03-28 22:39:17,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:17,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 76 letters. Loop has 72 letters. 79.21/40.86 [2019-03-28 22:39:17,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:17,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 4 letters. Loop has 144 letters. 79.21/40.86 [2019-03-28 22:39:17,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:17,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 750 transitions. 79.21/40.86 [2019-03-28 22:39:17,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:17,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 156 states and 179 transitions. 79.21/40.86 [2019-03-28 22:39:17,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 79.21/40.86 [2019-03-28 22:39:17,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 79.21/40.86 [2019-03-28 22:39:17,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 179 transitions. 79.21/40.86 [2019-03-28 22:39:17,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.86 [2019-03-28 22:39:17,213 INFO L706 BuchiCegarLoop]: Abstraction has 156 states and 179 transitions. 79.21/40.86 [2019-03-28 22:39:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 179 transitions. 79.21/40.86 [2019-03-28 22:39:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. 79.21/40.86 [2019-03-28 22:39:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.86 [2019-03-28 22:39:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,217 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 79.21/40.86 [2019-03-28 22:39:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 79.21/40.86 [2019-03-28 22:39:17,217 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand 11 states. 79.21/40.86 [2019-03-28 22:39:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.86 [2019-03-28 22:39:17,282 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 79.21/40.86 [2019-03-28 22:39:17,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:17,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 79.21/40.86 [2019-03-28 22:39:17,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 79.21/40.86 [2019-03-28 22:39:17,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.86 [2019-03-28 22:39:17,286 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. 79.21/40.86 [2019-03-28 22:39:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 79.21/40.86 [2019-03-28 22:39:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,289 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,289 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,289 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ 79.21/40.86 [2019-03-28 22:39:17,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 146 transitions. 79.21/40.86 [2019-03-28 22:39:17,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:17,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.86 [2019-03-28 22:39:17,290 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.86 [2019-03-28 22:39:17,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 79.21/40.86 [2019-03-28 22:39:17,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] 79.21/40.86 [2019-03-28 22:39:17,291 INFO L794 eck$LassoCheckResult]: Stem: 93933#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] 93934#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93943#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93944#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 93941#L15-1 79.21/40.86 [2019-03-28 22:39:17,292 INFO L796 eck$LassoCheckResult]: Loop: 93941#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] 93935#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93936#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93929#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93930#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] 94051#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94050#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94049#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94048#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] 94047#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94046#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94045#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94044#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] 94043#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94042#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94041#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94040#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] 94039#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94038#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94037#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94036#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] 94035#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94034#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94033#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94032#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] 94031#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94030#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94029#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94027#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] 94024#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94022#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94023#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94028#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] 94025#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94018#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 93948#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94017#L15-1 [59] 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] 94016#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94015#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94014#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94013#L15-1 [59] 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] 94012#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94009#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94008#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 94006#L15-1 [59] 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] 94004#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 94002#L12 [56] L12-->L12-2: Formula: (> 10 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[] 94000#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93998#L15-1 [59] 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] 93996#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93994#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93992#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93990#L15-1 [59] 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] 93988#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93986#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93984#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93982#L15-1 [59] 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] 93980#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93978#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93976#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93974#L15-1 [59] 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] 93972#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93970#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93968#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93966#L15-1 [59] 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] 93964#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93962#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93960#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93958#L15-1 [59] 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] 93956#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93954#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93953#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 93946#L15-1 [59] 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] 93950#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 93947#L12 [56] L12-->L12-2: Formula: (> 10 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[] 93945#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 93941#L15-1 79.21/40.86 [2019-03-28 22:39:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 17 times 79.21/40.86 [2019-03-28 22:39:17,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1359485141, now seen corresponding path program 18 times 79.21/40.86 [2019-03-28 22:39:17,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash -575409980, now seen corresponding path program 9 times 79.21/40.86 [2019-03-28 22:39:17,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 415 proven. 136 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.86 [2019-03-28 22:39:17,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 79.21/40.86 [2019-03-28 22:39:17,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 79.21/40.86 [2019-03-28 22:39:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 79.21/40.86 [2019-03-28 22:39:17,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) 79.21/40.86 [2019-03-28 22:39:17,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:17,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:17,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 415 proven. 136 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.86 [2019-03-28 22:39:17,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 79.21/40.86 [2019-03-28 22:39:17,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 79.21/40.86 [2019-03-28 22:39:17,871 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 69 79.21/40.86 [2019-03-28 22:39:17,877 INFO L216 LassoAnalysis]: Preferences: 79.21/40.86 [2019-03-28 22:39:17,877 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.86 [2019-03-28 22:39:17,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.86 [2019-03-28 22:39:17,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.86 [2019-03-28 22:39:17,878 INFO L127 ssoRankerPreferences]: Use exernal solver: true 79.21/40.86 [2019-03-28 22:39:17,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:17,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.86 [2019-03-28 22:39:17,878 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.86 [2019-03-28 22:39:17,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Loop 79.21/40.86 [2019-03-28 22:39:17,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.86 [2019-03-28 22:39:17,878 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.86 [2019-03-28 22:39:17,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,925 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.86 [2019-03-28 22:39:17,925 INFO L412 LassoAnalysis]: Checking for nontermination... 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:17,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:17,928 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 79.21/40.86 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 79.21/40.86 Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:17,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 79.21/40.86 [2019-03-28 22:39:17,958 INFO L163 nArgumentSynthesizer]: Using integer mode. 79.21/40.86 [2019-03-28 22:39:17,962 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 79.21/40.86 [2019-03-28 22:39:17,987 INFO L216 LassoAnalysis]: Preferences: 79.21/40.86 [2019-03-28 22:39:17,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 79.21/40.86 [2019-03-28 22:39:17,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 79.21/40.86 [2019-03-28 22:39:17,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 79.21/40.86 [2019-03-28 22:39:17,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false 79.21/40.86 [2019-03-28 22:39:17,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 79.21/40.86 [2019-03-28 22:39:17,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 79.21/40.86 [2019-03-28 22:39:17,988 INFO L130 ssoRankerPreferences]: Path of dumped script: 79.21/40.86 [2019-03-28 22:39:17,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Loop 79.21/40.86 [2019-03-28 22:39:17,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 79.21/40.86 [2019-03-28 22:39:17,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 79.21/40.86 [2019-03-28 22:39:17,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:17,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 79.21/40.86 [2019-03-28 22:39:18,036 INFO L300 LassoAnalysis]: Preprocessing complete. 79.21/40.86 [2019-03-28 22:39:18,037 INFO L497 LassoAnalysis]: Using template 'affine'. 79.21/40.86 [2019-03-28 22:39:18,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 79.21/40.86 Termination analysis: LINEAR_WITH_GUESSES 79.21/40.86 Number of strict supporting invariants: 0 79.21/40.86 Number of non-strict supporting invariants: 1 79.21/40.86 Consider only non-deceasing supporting invariants: true 79.21/40.86 Simplify termination arguments: true 79.21/40.86 Simplify supporting invariants: trueOverapproximate stem: false 79.21/40.86 [2019-03-28 22:39:18,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. 79.21/40.86 [2019-03-28 22:39:18,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 79.21/40.86 [2019-03-28 22:39:18,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 79.21/40.86 [2019-03-28 22:39:18,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 79.21/40.86 [2019-03-28 22:39:18,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 79.21/40.86 [2019-03-28 22:39:18,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 79.21/40.86 [2019-03-28 22:39:18,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 79.21/40.86 [2019-03-28 22:39:18,040 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 79.21/40.86 [2019-03-28 22:39:18,041 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 79.21/40.86 [2019-03-28 22:39:18,041 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 79.21/40.86 [2019-03-28 22:39:18,042 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 79.21/40.86 [2019-03-28 22:39:18,042 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 79.21/40.86 [2019-03-28 22:39:18,042 INFO L518 LassoAnalysis]: Proved termination. 79.21/40.86 [2019-03-28 22:39:18,042 INFO L520 LassoAnalysis]: Termination argument consisting of: 79.21/40.86 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 79.21/40.86 Supporting invariants [] 79.21/40.86 [2019-03-28 22:39:18,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 79.21/40.86 [2019-03-28 22:39:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. 79.21/40.86 [2019-03-28 22:39:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:18,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:18,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:19,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:19,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:20,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 79.21/40.86 [2019-03-28 22:39:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core 79.21/40.86 [2019-03-28 22:39:21,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 79.21/40.86 [2019-03-28 22:39:21,673 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 34 predicates after loop cannibalization 79.21/40.86 [2019-03-28 22:39:21,674 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 34 loop predicates 79.21/40.86 [2019-03-28 22:39:21,674 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 146 transitions. cyclomatic complexity: 25 Second operand 12 states. 79.21/40.86 [2019-03-28 22:39:23,072 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 146 transitions. cyclomatic complexity: 25. Second operand 12 states. Result 706 states and 758 transitions. Complement of second has 200 states. 79.21/40.86 [2019-03-28 22:39:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 1 stem states 30 non-accepting loop states 1 accepting loop states 79.21/40.86 [2019-03-28 22:39:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 79.21/40.86 [2019-03-28 22:39:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 127 transitions. 79.21/40.86 [2019-03-28 22:39:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 4 letters. Loop has 76 letters. 79.21/40.86 [2019-03-28 22:39:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 80 letters. Loop has 76 letters. 79.21/40.86 [2019-03-28 22:39:23,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:23,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 4 letters. Loop has 152 letters. 79.21/40.86 [2019-03-28 22:39:23,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. 79.21/40.86 [2019-03-28 22:39:23,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 706 states and 758 transitions. 79.21/40.86 [2019-03-28 22:39:23,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 706 states to 160 states and 172 transitions. 79.21/40.86 [2019-03-28 22:39:23,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 79.21/40.86 [2019-03-28 22:39:23,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 79.21/40.86 [2019-03-28 22:39:23,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 172 transitions. 79.21/40.86 [2019-03-28 22:39:23,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.86 [2019-03-28 22:39:23,083 INFO L706 BuchiCegarLoop]: Abstraction has 160 states and 172 transitions. 79.21/40.86 [2019-03-28 22:39:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 172 transitions. 79.21/40.86 [2019-03-28 22:39:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. 79.21/40.86 [2019-03-28 22:39:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. 79.21/40.86 [2019-03-28 22:39:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. 79.21/40.86 [2019-03-28 22:39:23,086 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 133 transitions. 79.21/40.86 [2019-03-28 22:39:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 79.21/40.86 [2019-03-28 22:39:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 79.21/40.86 [2019-03-28 22:39:23,087 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 12 states. 79.21/40.86 [2019-03-28 22:39:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 79.21/40.86 [2019-03-28 22:39:23,184 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. 79.21/40.86 [2019-03-28 22:39:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 79.21/40.86 [2019-03-28 22:39:23,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 185 transitions. 79.21/40.86 [2019-03-28 22:39:23,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:23,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 171 states and 183 transitions. 79.21/40.86 [2019-03-28 22:39:23,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 79.21/40.86 [2019-03-28 22:39:23,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 79.21/40.86 [2019-03-28 22:39:23,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 183 transitions. 79.21/40.86 [2019-03-28 22:39:23,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 79.21/40.86 [2019-03-28 22:39:23,189 INFO L706 BuchiCegarLoop]: Abstraction has 171 states and 183 transitions. 79.21/40.86 [2019-03-28 22:39:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 183 transitions. 79.21/40.86 [2019-03-28 22:39:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. 79.21/40.86 [2019-03-28 22:39:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. 79.21/40.86 [2019-03-28 22:39:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. 79.21/40.86 [2019-03-28 22:39:23,191 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 130 transitions. 79.21/40.86 [2019-03-28 22:39:23,192 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 130 transitions. 79.21/40.86 [2019-03-28 22:39:23,192 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ 79.21/40.86 [2019-03-28 22:39:23,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 130 transitions. 79.21/40.86 [2019-03-28 22:39:23,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 79.21/40.86 [2019-03-28 22:39:23,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 79.21/40.86 [2019-03-28 22:39:23,193 INFO L119 BuchiIsEmpty]: Starting construction of run 79.21/40.86 [2019-03-28 22:39:23,193 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 79.21/40.86 [2019-03-28 22:39:23,193 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] 79.21/40.86 [2019-03-28 22:39:23,194 INFO L794 eck$LassoCheckResult]: Stem: 112556#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] 112557#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112567#L12 79.21/40.86 [2019-03-28 22:39:23,194 INFO L796 eck$LassoCheckResult]: Loop: 112567#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112569#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) 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] 112570#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] 112576#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112573#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112571#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112572#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] 112574#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112575#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112605#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112604#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] 112603#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112602#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112601#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112600#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] 112599#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112598#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112597#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112596#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] 112595#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112594#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112593#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112592#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] 112591#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112590#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112589#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112588#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] 112587#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112586#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112585#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112584#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] 112583#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112582#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112581#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112580#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] 112579#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112578#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112577#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112564#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] 112565#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112562#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) 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] 112563#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112568#L15-1 [59] 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] 112558#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112559#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112552#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112553#L15-1 [59] 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] 112669#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112668#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112667#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112666#L15-1 [59] 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] 112665#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112664#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112663#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112662#L15-1 [59] 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] 112661#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112660#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112659#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112658#L15-1 [59] 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] 112657#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112656#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112655#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112654#L15-1 [59] 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] 112653#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112652#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112651#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112650#L15-1 [59] 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] 112649#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112648#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112647#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112646#L15-1 [59] 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] 112645#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112619#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112618#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112616#L15-1 [59] 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] 112613#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112614#L12 [56] L12-->L12-2: Formula: (> 10 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[] 112617#L12-2 [57] L12-2-->L15-1: Formula: (< 0 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[] 112615#L15-1 [59] 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] 112606#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 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[] 112567#L12 79.21/40.86 [2019-03-28 22:39:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times 79.21/40.86 [2019-03-28 22:39:23,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:23,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 360041138, now seen corresponding path program 19 times 79.21/40.86 [2019-03-28 22:39:23,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:23,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:23,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 79.21/40.86 [2019-03-28 22:39:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1103309515, now seen corresponding path program 10 times 79.21/40.86 [2019-03-28 22:39:23,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 79.21/40.86 [2019-03-28 22:39:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 79.21/40.86 [2019-03-28 22:39:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 79.21/40.86 [2019-03-28 22:39:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 79.21/40.86 [2019-03-28 22:39:23,727 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 70 79.21/40.86 [2019-03-28 22:39:23,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:23 BasicIcfg 79.21/40.86 [2019-03-28 22:39:23,771 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 79.21/40.86 [2019-03-28 22:39:23,772 INFO L168 Benchmark]: Toolchain (without parser) took 36534.46 ms. Allocated memory was 649.6 MB in the beginning and 1.4 GB in the end (delta: 770.7 MB). Free memory was 563.8 MB in the beginning and 959.8 MB in the end (delta: -395.9 MB). Peak memory consumption was 374.8 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,773 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.81 ms. Allocated memory is still 649.6 MB. Free memory was 563.8 MB in the beginning and 554.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.65 ms. Allocated memory was 649.6 MB in the beginning and 652.2 MB in the end (delta: 2.6 MB). Free memory was 554.3 MB in the beginning and 618.4 MB in the end (delta: -64.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,774 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 ms. Allocated memory is still 652.2 MB. Free memory was 618.4 MB in the beginning and 616.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,774 INFO L168 Benchmark]: RCFGBuilder took 200.61 ms. Allocated memory is still 652.2 MB. Free memory was 616.7 MB in the beginning and 602.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,775 INFO L168 Benchmark]: BlockEncodingV2 took 79.74 ms. Allocated memory is still 652.2 MB. Free memory was 602.4 MB in the beginning and 595.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,775 INFO L168 Benchmark]: TraceAbstraction took 156.96 ms. Allocated memory is still 652.2 MB. Free memory was 595.9 MB in the beginning and 587.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,775 INFO L168 Benchmark]: BuchiAutomizer took 35734.81 ms. Allocated memory was 652.2 MB in the beginning and 1.4 GB in the end (delta: 768.1 MB). Free memory was 586.5 MB in the beginning and 959.8 MB in the end (delta: -373.3 MB). Peak memory consumption was 394.8 MB. Max. memory is 50.3 GB. 79.21/40.86 [2019-03-28 22:39:23,779 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 79.21/40.86 --- Results --- 79.21/40.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 79.21/40.86 - StatisticsResult: Initial Icfg 79.21/40.86 9 locations, 13 edges 79.21/40.86 - StatisticsResult: Encoded RCFG 79.21/40.86 5 locations, 11 edges 79.21/40.86 * Results from de.uni_freiburg.informatik.ultimate.core: 79.21/40.86 - StatisticsResult: Toolchain Benchmarks 79.21/40.86 Benchmark results are: 79.21/40.86 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 79.21/40.86 * CACSL2BoogieTranslator took 234.81 ms. Allocated memory is still 649.6 MB. Free memory was 563.8 MB in the beginning and 554.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 79.21/40.86 * Boogie Procedure Inliner took 101.65 ms. Allocated memory was 649.6 MB in the beginning and 652.2 MB in the end (delta: 2.6 MB). Free memory was 554.3 MB in the beginning and 618.4 MB in the end (delta: -64.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 79.21/40.86 * Boogie Preprocessor took 19.74 ms. Allocated memory is still 652.2 MB. Free memory was 618.4 MB in the beginning and 616.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 79.21/40.86 * RCFGBuilder took 200.61 ms. Allocated memory is still 652.2 MB. Free memory was 616.7 MB in the beginning and 602.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 79.21/40.86 * BlockEncodingV2 took 79.74 ms. Allocated memory is still 652.2 MB. Free memory was 602.4 MB in the beginning and 595.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 79.21/40.86 * TraceAbstraction took 156.96 ms. Allocated memory is still 652.2 MB. Free memory was 595.9 MB in the beginning and 587.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 79.21/40.86 * BuchiAutomizer took 35734.81 ms. Allocated memory was 652.2 MB in the beginning and 1.4 GB in the end (delta: 768.1 MB). Free memory was 586.5 MB in the beginning and 959.8 MB in the end (delta: -373.3 MB). Peak memory consumption was 394.8 MB. Max. memory is 50.3 GB. 79.21/40.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 79.21/40.86 - AllSpecificationsHoldResult: All specifications hold 79.21/40.86 We were not able to verify any specifiation because the program does not contain any specification. 79.21/40.86 - InvariantResult [Line: 11]: Loop Invariant 79.21/40.86 Derived loop invariant: 1 79.21/40.86 - StatisticsResult: Ultimate Automizer benchmark data 79.21/40.86 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 79.21/40.86 - StatisticsResult: Constructed decomposition of program 79.21/40.86 Your program was decomposed into 34 terminating modules (22 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 7 locations. One nondeterministic module has affine ranking function up and consists of 5 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 11 locations. One nondeterministic module has affine ranking function i and consists of 13 locations. One nondeterministic module has affine ranking function i and consists of 15 locations. One nondeterministic module has affine ranking function i and consists of 17 locations. One nondeterministic module has affine ranking function i and consists of 19 locations. One nondeterministic module has affine ranking function i and consists of 21 locations. One nondeterministic module has affine ranking function i and consists of 23 locations. One nondeterministic module has affine ranking function i and consists of 33 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 118 locations. 79.21/40.86 - StatisticsResult: Timing statistics 79.21/40.86 BüchiAutomizer plugin needed 35.6s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 9.1s. Construction of modules took 1.8s. Büchi inclusion checks took 24.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 32. Automata minimization 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 360 StatesRemovedByMinimization, 25 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 123 states and ocurred in iteration 15. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1701/3904 HoareTripleCheckerStatistics: 164 SDtfs, 1149 SDslu, 30 SDs, 0 SdLazy, 2585 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT2 conc0 concLT10 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax180 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf89 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 79.21/40.86 - TerminationAnalysisResult: Nontermination possible 79.21/40.86 Buchi Automizer proved that your program is nonterminating for some inputs 79.21/40.86 - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. 79.21/40.86 Nontermination argument in form of an infinite execution 79.21/40.86 State at position 0 is 79.21/40.86 {} 79.21/40.86 State at position 1 is 79.21/40.86 {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@610cfbe0=0, \result=0, i=0} 79.21/40.86 - StatisticsResult: NonterminationArgumentStatistics 79.21/40.86 Fixpoint 79.21/40.86 - NonterminatingLassoResult [Line: 12]: Nonterminating execution 79.21/40.86 Found a nonterminating execution for the following lasso shaped sequence of statements. 79.21/40.86 Stem: 79.21/40.86 [L6] int i; 79.21/40.86 [L7] int up; 79.21/40.86 [L8] i = __VERIFIER_nondet_int() 79.21/40.86 [L9] up = 0 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 Loop: 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND TRUE i == 0 79.21/40.86 [L16] up = 1 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND TRUE up == 1 79.21/40.86 [L19] i = i+1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND TRUE i == 10 79.21/40.86 [L13] up = 0 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 [L12] COND FALSE !(i == 10) 79.21/40.86 [L15] COND FALSE !(i == 0) 79.21/40.86 [L18] COND FALSE !(up == 1) 79.21/40.86 [L21] i = i-1 79.21/40.86 [L11] COND TRUE 0 <= i && i <= 10 79.21/40.86 End of lasso representation. 79.21/40.86 RESULT: Ultimate proved your program to be incorrect! 79.21/40.86 !SESSION 2019-03-28 22:38:43.946 ----------------------------------------------- 79.21/40.86 eclipse.buildId=unknown 79.21/40.86 java.version=1.8.0_181 79.21/40.86 java.vendor=Oracle Corporation 79.21/40.86 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 79.21/40.86 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 79.21/40.86 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 79.21/40.86 79.21/40.86 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:39:24.024 79.21/40.86 !MESSAGE The workspace will exit with unsaved changes in this session. 79.21/40.86 Received shutdown request... 79.21/40.86 Ultimate: 79.21/40.86 GTK+ Version Check 79.21/40.86 EOF