/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:06:08,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:06:08,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:06:08,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:06:08,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:06:08,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:06:08,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:06:08,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:06:08,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:06:08,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:06:08,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:06:08,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:06:08,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:06:08,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:06:08,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:06:08,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:06:08,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:06:08,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:06:08,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:06:08,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:06:08,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:06:08,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:06:08,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:06:08,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:06:08,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:06:08,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:06:08,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:06:08,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:06:08,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:06:08,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:06:08,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:06:08,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:06:08,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:06:08,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:06:08,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:06:08,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:06:08,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:06:08,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:06:08,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:06:08,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:06:08,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:06:08,442 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:06:08,456 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:06:08,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:06:08,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:06:08,458 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:06:08,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:06:08,458 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:06:08,458 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:06:08,459 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:06:08,459 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:06:08,459 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:06:08,459 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:06:08,459 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:06:08,459 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:06:08,460 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:06:08,460 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:08,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:06:08,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:06:08,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:06:08,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:06:08,461 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:06:08,461 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:06:08,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:06:08,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:06:08,462 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:06:08,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:06:08,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:06:08,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:06:08,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:06:08,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:06:10,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:06:10,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:06:10,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:06:10,445 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:06:10,445 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:06:10,446 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:06:10,546 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Xk34TT/tmp/26095e9ec90048a5991c043f7df35128/FLAG7f836a05f [2020-07-01 11:06:11,083 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:06:11,084 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:06:11,090 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Xk34TT/tmp/26095e9ec90048a5991c043f7df35128/FLAG7f836a05f [2020-07-01 11:06:11,516 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Xk34TT/tmp/26095e9ec90048a5991c043f7df35128 [2020-07-01 11:06:11,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:06:11,529 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:06:11,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:06:11,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:06:11,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:06:11,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50df6453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11, skipping insertion in model container [2020-07-01 11:06:11,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:06:11,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:06:11,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:06:11,778 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:06:11,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:06:11,808 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:06:11,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11 WrapperNode [2020-07-01 11:06:11,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:06:11,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:06:11,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:06:11,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:06:11,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:06:11,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:06:11,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:06:11,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:06:11,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... [2020-07-01 11:06:11,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:06:11,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:06:11,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:06:11,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:06:11,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:06:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:06:12,090 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:06:12,091 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 11:06:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:12 BoogieIcfgContainer [2020-07-01 11:06:12,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:06:12,095 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:06:12,095 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:06:12,097 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:06:12,098 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:12" (1/1) ... [2020-07-01 11:06:12,110 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-07-01 11:06:12,111 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:06:12,112 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:06:12,112 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:06:12,113 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:06:12,114 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:06:12,115 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:06:12,115 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:06:12,130 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:06:12,144 INFO L200 BlockEncoder]: SBE split 1 edges [2020-07-01 11:06:12,148 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:06:12,149 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:06:12,159 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 11:06:12,161 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 11:06:12,162 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:06:12,162 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:06:12,163 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:06:12,163 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:06:12,163 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 8 edges [2020-07-01 11:06:12,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:12 BasicIcfg [2020-07-01 11:06:12,164 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:06:12,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:06:12,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:06:12,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:06:12,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:06:11" (1/4) ... [2020-07-01 11:06:12,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fc09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (2/4) ... [2020-07-01 11:06:12,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fc09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:12" (3/4) ... [2020-07-01 11:06:12,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fc09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:12" (4/4) ... [2020-07-01 11:06:12,172 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:06:12,182 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:06:12,205 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:06:12,219 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:06:12,242 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:06:12,242 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:06:12,242 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:06:12,242 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:06:12,242 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:06:12,243 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:06:12,243 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:06:12,243 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:06:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-07-01 11:06:12,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:06:12,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-07-01 11:06:12,316 INFO L271 CegarLoopResult]: At program point L18-1(lines 11 23) the Hoare annotation is: true [2020-07-01 11:06:12,316 INFO L268 CegarLoopResult]: For program point L15-1(lines 11 23) no Hoare annotation was computed. [2020-07-01 11:06:12,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:06:12,317 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:06:12,317 INFO L268 CegarLoopResult]: For program point L12-2(lines 11 23) no Hoare annotation was computed. [2020-07-01 11:06:12,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:12 BasicIcfg [2020-07-01 11:06:12,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:06:12,326 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:06:12,326 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:06:12,329 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:06:12,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:12,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:06:11" (1/5) ... [2020-07-01 11:06:12,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9f6a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:12,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:06:11" (2/5) ... [2020-07-01 11:06:12,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9f6a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:12,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:12" (3/5) ... [2020-07-01 11:06:12,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9f6a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:12,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:12" (4/5) ... [2020-07-01 11:06:12,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9f6a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:06:12, skipping insertion in model container [2020-07-01 11:06:12,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:12,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:12" (5/5) ... [2020-07-01 11:06:12,335 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:06:12,364 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:06:12,364 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:06:12,364 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:06:12,364 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:06:12,364 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:06:12,365 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:06:12,365 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:06:12,365 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:06:12,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-01 11:06:12,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:06:12,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:12,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:12,392 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:06:12,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:06:12,393 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:06:12,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-01 11:06:12,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:06:12,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:12,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:12,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:06:12,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:06:12,399 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 [2020-07-01 11:06:12,400 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~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 [50] 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 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 7#L15-1true [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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 [2020-07-01 11:06:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-07-01 11:06:12,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:12,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168529800] [2020-07-01 11:06:12,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2194635, now seen corresponding path program 1 times [2020-07-01 11:06:12,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:12,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948954175] [2020-07-01 11:06:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 64994063, now seen corresponding path program 1 times [2020-07-01 11:06:12,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:12,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589267960] [2020-07-01 11:06:12,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:12,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:12,591 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:12,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:12,592 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:12,592 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:12,592 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:12,592 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:12,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:12,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:06:12,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:12,593 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:12,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,723 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:12,724 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:12,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:12,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:12,741 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:12,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:12,780 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:12,780 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:12,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:12,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:12,818 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:12,852 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:12,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:12,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:12,897 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:12,927 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:12,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:12,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:12,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:12,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:12,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:12,928 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:12,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:12,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:06:12,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:12,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:12,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:12,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:13,021 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:13,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:13,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:13,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:13,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:13,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:13,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:13,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:13,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:13,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:13,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:13,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:13,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:13,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:13,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:13,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:13,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:13,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:13,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:13,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:13,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:13,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:13,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:13,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:13,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:13,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:13,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:13,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:13,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:13,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:13,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:13,170 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:06:13,170 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:13,176 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:13,177 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:13,177 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:06:13,211 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:13,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:13,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:13,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:13,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:13,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:13,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:13,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:13,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:13,371 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:06:13,376 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 4 loop predicates [2020-07-01 11:06:13,378 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. [2020-07-01 11:06:13,560 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 43 states and 70 transitions. Complement of second has 13 states. [2020-07-01 11:06:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 11:06:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:06:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-01 11:06:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-01 11:06:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 11:06:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-01 11:06:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:13,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 70 transitions. [2020-07-01 11:06:13,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-01 11:06:13,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 59 transitions. [2020-07-01 11:06:13,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-01 11:06:13,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-01 11:06:13,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 59 transitions. [2020-07-01 11:06:13,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:13,585 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-07-01 11:06:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 59 transitions. [2020-07-01 11:06:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-07-01 11:06:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 11:06:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-07-01 11:06:13,616 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-07-01 11:06:13,617 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-07-01 11:06:13,617 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:06:13,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 51 transitions. [2020-07-01 11:06:13,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 11:06:13,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:13,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:13,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:06:13,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:06:13,620 INFO L794 eck$LassoCheckResult]: Stem: 126#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] 127#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 142#L12 [50] 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[] 147#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 123#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 128#L18-1 [2020-07-01 11:06:13,620 INFO L796 eck$LassoCheckResult]: Loop: 128#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 129#L12 [50] 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[] 132#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 152#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 128#L18-1 [2020-07-01 11:06:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 64994056, now seen corresponding path program 1 times [2020-07-01 11:06:13,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:13,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054172056] [2020-07-01 11:06:13,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:13,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054172056] [2020-07-01 11:06:13,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:13,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 11:06:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608478966] [2020-07-01 11:06:13,662 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 11:06:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2194635, now seen corresponding path program 2 times [2020-07-01 11:06:13,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:13,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636871112] [2020-07-01 11:06:13,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:13,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:13,709 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:13,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:13,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:13,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:13,709 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:13,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:13,710 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:13,710 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:06:13,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:13,710 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:13,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,784 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:13,784 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:13,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:13,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:13,797 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:13,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:13,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:13,836 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:13,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:13,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:13,876 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:13,910 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:13,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:13,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:13,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:13,982 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:13,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:13,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:13,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:13,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:13,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:13,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:13,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:13,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:06:13,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:13,984 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:13,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:14,063 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:14,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:14,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:14,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:14,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:14,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:14,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:14,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:14,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:14,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:14,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:14,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:14,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:14,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:14,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:14,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:14,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:14,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:14,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:14,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:14,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:14,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:14,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:14,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:14,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:14,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:14,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:14,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:14,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:14,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:14,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:14,214 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:06:14,215 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:14,219 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:14,220 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:14,220 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:06:14,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:14,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:14,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:14,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:14,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:14,355 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:06:14,355 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 4 loop predicates [2020-07-01 11:06:14,356 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 51 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-07-01 11:06:14,488 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 51 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 225 states and 359 transitions. Complement of second has 53 states. [2020-07-01 11:06:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 11:06:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:06:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-01 11:06:14,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 11:06:14,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:14,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-01 11:06:14,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:14,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-01 11:06:14,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:14,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 359 transitions. [2020-07-01 11:06:14,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2020-07-01 11:06:14,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 122 states and 187 transitions. [2020-07-01 11:06:14,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-07-01 11:06:14,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-01 11:06:14,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 187 transitions. [2020-07-01 11:06:14,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:14,505 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 187 transitions. [2020-07-01 11:06:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 187 transitions. [2020-07-01 11:06:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 51. [2020-07-01 11:06:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 11:06:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2020-07-01 11:06:14,512 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 85 transitions. [2020-07-01 11:06:14,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:14,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:14,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:14,517 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand 3 states. [2020-07-01 11:06:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:14,542 INFO L93 Difference]: Finished difference Result 55 states and 88 transitions. [2020-07-01 11:06:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:14,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 88 transitions. [2020-07-01 11:06:14,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2020-07-01 11:06:14,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 45 states and 68 transitions. [2020-07-01 11:06:14,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-01 11:06:14,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-01 11:06:14,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 68 transitions. [2020-07-01 11:06:14,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:14,547 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 68 transitions. [2020-07-01 11:06:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 68 transitions. [2020-07-01 11:06:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-07-01 11:06:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:06:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-07-01 11:06:14,550 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-07-01 11:06:14,550 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-07-01 11:06:14,550 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:06:14,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2020-07-01 11:06:14,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2020-07-01 11:06:14,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:14,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:14,552 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:14,552 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:14,552 INFO L794 eck$LassoCheckResult]: Stem: 610#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] 611#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 613#L12 [2020-07-01 11:06:14,553 INFO L796 eck$LassoCheckResult]: Loop: 613#L12 [50] 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[] 606#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 607#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 629#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 630#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] 608#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 609#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 634#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 613#L12 [2020-07-01 11:06:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times [2020-07-01 11:06:14,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204886282] [2020-07-01 11:06:14,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1648411443, now seen corresponding path program 1 times [2020-07-01 11:06:14,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977692909] [2020-07-01 11:06:14,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:14,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977692909] [2020-07-01 11:06:14,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:14,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:06:14,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722936985] [2020-07-01 11:06:14,584 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:14,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:06:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:06:14,585 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-07-01 11:06:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:14,614 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2020-07-01 11:06:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:06:14,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 59 transitions. [2020-07-01 11:06:14,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2020-07-01 11:06:14,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 59 transitions. [2020-07-01 11:06:14,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-01 11:06:14,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-01 11:06:14,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 59 transitions. [2020-07-01 11:06:14,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:14,618 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2020-07-01 11:06:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 59 transitions. [2020-07-01 11:06:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-01 11:06:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 11:06:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2020-07-01 11:06:14,622 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2020-07-01 11:06:14,622 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2020-07-01 11:06:14,622 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:06:14,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2020-07-01 11:06:14,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2020-07-01 11:06:14,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:14,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:14,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:14,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-01 11:06:14,623 INFO L794 eck$LassoCheckResult]: Stem: 697#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] 698#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 700#L12 [2020-07-01 11:06:14,624 INFO L796 eck$LassoCheckResult]: Loop: 700#L12 [50] 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[] 718#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 707#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 708#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 717#L12 [50] 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[] 704#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 709#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 710#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 700#L12 [2020-07-01 11:06:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 2 times [2020-07-01 11:06:14,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900532896] [2020-07-01 11:06:14,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1648173115, now seen corresponding path program 1 times [2020-07-01 11:06:14,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258412788] [2020-07-01 11:06:14,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:06:14,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258412788] [2020-07-01 11:06:14,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:14,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:14,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425194575] [2020-07-01 11:06:14,655 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:14,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:14,655 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 19 Second operand 3 states. [2020-07-01 11:06:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:14,669 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-07-01 11:06:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:14,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2020-07-01 11:06:14,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2020-07-01 11:06:14,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 43 transitions. [2020-07-01 11:06:14,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-01 11:06:14,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-01 11:06:14,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2020-07-01 11:06:14,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:14,672 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-01 11:06:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2020-07-01 11:06:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-07-01 11:06:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:06:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-01 11:06:14,675 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-01 11:06:14,675 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-01 11:06:14,675 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:06:14,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-01 11:06:14,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-07-01 11:06:14,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:14,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:14,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:06:14,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:06:14,677 INFO L794 eck$LassoCheckResult]: Stem: 778#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] 779#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 781#L12 [50] 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[] 800#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 792#L15-1 [2020-07-01 11:06:14,677 INFO L796 eck$LassoCheckResult]: Loop: 792#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 797#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 794#L12 [50] 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[] 791#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 792#L15-1 [2020-07-01 11:06:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2096566, now seen corresponding path program 1 times [2020-07-01 11:06:14,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006243583] [2020-07-01 11:06:14,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2305103, now seen corresponding path program 1 times [2020-07-01 11:06:14,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485275828] [2020-07-01 11:06:14,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:14,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -806140028, now seen corresponding path program 1 times [2020-07-01 11:06:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253662539] [2020-07-01 11:06:14,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:14,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253662539] [2020-07-01 11:06:14,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:14,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:14,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524041070] [2020-07-01 11:06:14,745 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:14,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:14,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:14,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:14,745 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:14,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:14,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:14,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:14,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:06:14,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:14,746 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:14,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,804 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:14,805 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:14,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:14,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:14,814 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:14,814 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:14,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:14,847 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:14,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:14,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:14,970 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:14,972 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:14,972 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:14,972 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:14,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:14,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:14,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:14,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:14,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:14,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:06:14,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:14,973 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:15,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:15,054 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:15,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:15,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:15,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:15,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:15,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:15,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:15,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:15,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:15,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:15,065 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:06:15,066 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:15,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:15,069 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:15,069 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:15,069 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:06:15,099 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,209 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:06:15,209 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 4 loop predicates [2020-07-01 11:06:15,210 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-01 11:06:15,282 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 68 states and 84 transitions. Complement of second has 9 states. [2020-07-01 11:06:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-07-01 11:06:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:06:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-01 11:06:15,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:06:15,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:15,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-01 11:06:15,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:15,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 11:06:15,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:15,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 84 transitions. [2020-07-01 11:06:15,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2020-07-01 11:06:15,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 56 states and 70 transitions. [2020-07-01 11:06:15,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 11:06:15,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-01 11:06:15,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2020-07-01 11:06:15,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,289 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-07-01 11:06:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2020-07-01 11:06:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2020-07-01 11:06:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 11:06:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-07-01 11:06:15,292 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-01 11:06:15,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:06:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:06:15,293 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 4 states. [2020-07-01 11:06:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,315 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-01 11:06:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:06:15,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2020-07-01 11:06:15,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2020-07-01 11:06:15,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 41 transitions. [2020-07-01 11:06:15,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-01 11:06:15,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-01 11:06:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2020-07-01 11:06:15,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,318 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-07-01 11:06:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2020-07-01 11:06:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-01 11:06:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 11:06:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-07-01 11:06:15,321 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-01 11:06:15,321 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-01 11:06:15,321 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:06:15,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-07-01 11:06:15,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-07-01 11:06:15,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:15,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:15,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:15,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2020-07-01 11:06:15,322 INFO L794 eck$LassoCheckResult]: Stem: 1023#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] 1024#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1033#L12 [2020-07-01 11:06:15,323 INFO L796 eck$LassoCheckResult]: Loop: 1033#L12 [50] 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[] 1032#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 1030#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1031#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1029#L12 [50] 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[] 1021#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1022#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1027#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1028#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] 1051#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1050#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1049#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1035#L12 [50] 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[] 1041#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1039#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1034#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1033#L12 [2020-07-01 11:06:15,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 3 times [2020-07-01 11:06:15,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947837534] [2020-07-01 11:06:15,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1291869728, now seen corresponding path program 2 times [2020-07-01 11:06:15,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392725560] [2020-07-01 11:06:15,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392725560] [2020-07-01 11:06:15,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860797146] [2020-07-01 11:06:15,366 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:06:15,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:15,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:15,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 11:06:15,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14034798] [2020-07-01 11:06:15,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:15,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:06:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:06:15,402 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-01 11:06:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,430 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-01 11:06:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:06:15,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions. [2020-07-01 11:06:15,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2020-07-01 11:06:15,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 59 transitions. [2020-07-01 11:06:15,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-01 11:06:15,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-01 11:06:15,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 59 transitions. [2020-07-01 11:06:15,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,433 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-01 11:06:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 59 transitions. [2020-07-01 11:06:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2020-07-01 11:06:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 11:06:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-07-01 11:06:15,436 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-07-01 11:06:15,436 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-07-01 11:06:15,437 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 11:06:15,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-07-01 11:06:15,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-07-01 11:06:15,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:15,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:15,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:15,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2020-07-01 11:06:15,438 INFO L794 eck$LassoCheckResult]: Stem: 1161#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] 1162#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1171#L12 [2020-07-01 11:06:15,439 INFO L796 eck$LassoCheckResult]: Loop: 1171#L12 [50] 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[] 1170#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 1167#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1168#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1187#L12 [50] 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[] 1186#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1185#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1184#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1183#L12 [50] 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[] 1180#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1182#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1181#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1179#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] 1178#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1177#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1176#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1172#L12 [50] 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[] 1175#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1174#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1173#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1171#L12 [2020-07-01 11:06:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 4 times [2020-07-01 11:06:15,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804932171] [2020-07-01 11:06:15,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1429528189, now seen corresponding path program 3 times [2020-07-01 11:06:15,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654382210] [2020-07-01 11:06:15,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654382210] [2020-07-01 11:06:15,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297401042] [2020-07-01 11:06:15,486 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-01 11:06:15,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:15,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:15,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-01 11:06:15,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631894633] [2020-07-01 11:06:15,517 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:06:15,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:06:15,518 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-01 11:06:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,553 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-07-01 11:06:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:06:15,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 71 transitions. [2020-07-01 11:06:15,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-07-01 11:06:15,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 71 transitions. [2020-07-01 11:06:15,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-01 11:06:15,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-01 11:06:15,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 71 transitions. [2020-07-01 11:06:15,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,557 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 71 transitions. [2020-07-01 11:06:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 71 transitions. [2020-07-01 11:06:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2020-07-01 11:06:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 11:06:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2020-07-01 11:06:15,560 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2020-07-01 11:06:15,560 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2020-07-01 11:06:15,560 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 11:06:15,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2020-07-01 11:06:15,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2020-07-01 11:06:15,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:15,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:15,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:15,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2020-07-01 11:06:15,562 INFO L794 eck$LassoCheckResult]: Stem: 1332#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] 1333#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1342#L12 [2020-07-01 11:06:15,563 INFO L796 eck$LassoCheckResult]: Loop: 1342#L12 [50] 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[] 1341#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 1338#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1339#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1362#L12 [50] 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[] 1361#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1360#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1359#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1358#L12 [50] 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[] 1357#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1356#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1355#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1354#L12 [50] 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[] 1351#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1353#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1352#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1350#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] 1349#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1348#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1347#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1343#L12 [50] 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[] 1346#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1345#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1344#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1342#L12 [2020-07-01 11:06:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 5 times [2020-07-01 11:06:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424844486] [2020-07-01 11:06:15,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 722502810, now seen corresponding path program 4 times [2020-07-01 11:06:15,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235027044] [2020-07-01 11:06:15,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235027044] [2020-07-01 11:06:15,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636389515] [2020-07-01 11:06:15,617 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 11:06:15,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:15,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:15,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-01 11:06:15,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754499413] [2020-07-01 11:06:15,649 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:15,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:06:15,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:15,650 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-01 11:06:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,694 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-07-01 11:06:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:06:15,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 83 transitions. [2020-07-01 11:06:15,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2020-07-01 11:06:15,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 83 transitions. [2020-07-01 11:06:15,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-01 11:06:15,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-01 11:06:15,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 83 transitions. [2020-07-01 11:06:15,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,698 INFO L688 BuchiCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-07-01 11:06:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 83 transitions. [2020-07-01 11:06:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2020-07-01 11:06:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 11:06:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-07-01 11:06:15,701 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-01 11:06:15,701 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-01 11:06:15,701 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 11:06:15,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 64 transitions. [2020-07-01 11:06:15,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2020-07-01 11:06:15,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:15,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:15,703 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:15,703 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2020-07-01 11:06:15,703 INFO L794 eck$LassoCheckResult]: Stem: 1536#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] 1537#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1548#L12 [2020-07-01 11:06:15,703 INFO L796 eck$LassoCheckResult]: Loop: 1548#L12 [50] 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[] 1547#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 1543#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1544#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1572#L12 [50] 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[] 1571#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1570#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1569#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1568#L12 [50] 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[] 1567#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1566#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1565#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1564#L12 [50] 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[] 1563#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1562#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1561#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1560#L12 [50] 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[] 1557#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1559#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1558#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1556#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] 1555#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1554#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1553#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1549#L12 [50] 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[] 1552#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1551#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1550#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1548#L12 [2020-07-01 11:06:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 6 times [2020-07-01 11:06:15,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199334048] [2020-07-01 11:06:15,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1069427657, now seen corresponding path program 5 times [2020-07-01 11:06:15,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547166784] [2020-07-01 11:06:15,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547166784] [2020-07-01 11:06:15,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380162838] [2020-07-01 11:06:15,785 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-07-01 11:06:15,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:15,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:15,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:15,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-01 11:06:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858242528] [2020-07-01 11:06:15,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:15,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:06:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:06:15,822 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-01 11:06:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,883 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-07-01 11:06:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:06:15,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 95 transitions. [2020-07-01 11:06:15,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2020-07-01 11:06:15,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 88 states and 95 transitions. [2020-07-01 11:06:15,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-01 11:06:15,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-01 11:06:15,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 95 transitions. [2020-07-01 11:06:15,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:15,887 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 95 transitions. [2020-07-01 11:06:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 95 transitions. [2020-07-01 11:06:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-07-01 11:06:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-01 11:06:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-01 11:06:15,891 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-01 11:06:15,891 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-01 11:06:15,891 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 11:06:15,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 72 transitions. [2020-07-01 11:06:15,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-07-01 11:06:15,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:15,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:15,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:15,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2020-07-01 11:06:15,893 INFO L794 eck$LassoCheckResult]: Stem: 1773#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] 1774#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1785#L12 [2020-07-01 11:06:15,893 INFO L796 eck$LassoCheckResult]: Loop: 1785#L12 [50] 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[] 1784#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 1780#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1781#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1813#L12 [50] 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[] 1812#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1811#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1810#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1809#L12 [50] 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[] 1808#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1807#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1806#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1805#L12 [50] 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[] 1804#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1803#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1802#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1801#L12 [50] 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[] 1800#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1799#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1798#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1797#L12 [50] 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[] 1794#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1796#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 1795#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1793#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] 1792#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1791#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1790#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1786#L12 [50] 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[] 1789#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1788#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 1787#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1785#L12 [2020-07-01 11:06:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 7 times [2020-07-01 11:06:15,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921364930] [2020-07-01 11:06:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:15,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1227354796, now seen corresponding path program 6 times [2020-07-01 11:06:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233592364] [2020-07-01 11:06:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233592364] [2020-07-01 11:06:16,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529926736] [2020-07-01 11:06:16,006 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:16,032 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-07-01 11:06:16,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:16,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:16,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:16,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-01 11:06:16,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154198624] [2020-07-01 11:06:16,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:16,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:06:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:06:16,044 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-07-01 11:06:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:16,105 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2020-07-01 11:06:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:06:16,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 107 transitions. [2020-07-01 11:06:16,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-07-01 11:06:16,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 107 transitions. [2020-07-01 11:06:16,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-07-01 11:06:16,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-01 11:06:16,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 107 transitions. [2020-07-01 11:06:16,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:16,109 INFO L688 BuchiCegarLoop]: Abstraction has 100 states and 107 transitions. [2020-07-01 11:06:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 107 transitions. [2020-07-01 11:06:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2020-07-01 11:06:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-01 11:06:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2020-07-01 11:06:16,112 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 80 transitions. [2020-07-01 11:06:16,112 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 80 transitions. [2020-07-01 11:06:16,112 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-01 11:06:16,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 80 transitions. [2020-07-01 11:06:16,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2020-07-01 11:06:16,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:16,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:16,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:16,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2020-07-01 11:06:16,114 INFO L794 eck$LassoCheckResult]: Stem: 2043#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] 2044#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2055#L12 [2020-07-01 11:06:16,115 INFO L796 eck$LassoCheckResult]: Loop: 2055#L12 [50] 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[] 2054#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 2050#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2051#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2087#L12 [50] 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[] 2086#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2085#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2084#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2083#L12 [50] 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[] 2082#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2081#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2080#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2079#L12 [50] 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[] 2078#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2077#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2076#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2075#L12 [50] 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[] 2074#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2073#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2072#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2071#L12 [50] 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[] 2070#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2069#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2068#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2067#L12 [50] 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[] 2064#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2066#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2065#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2063#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] 2062#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2061#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2060#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2056#L12 [50] 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[] 2059#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2058#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2057#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2055#L12 [2020-07-01 11:06:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 8 times [2020-07-01 11:06:16,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500198363] [2020-07-01 11:06:16,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1757253647, now seen corresponding path program 7 times [2020-07-01 11:06:16,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288213445] [2020-07-01 11:06:16,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 78 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288213445] [2020-07-01 11:06:16,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802280843] [2020-07-01 11:06:16,197 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:06:16,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 78 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:16,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-01 11:06:16,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162062243] [2020-07-01 11:06:16,238 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:16,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:16,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 11:06:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:06:16,239 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-07-01 11:06:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:16,315 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2020-07-01 11:06:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 11:06:16,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 119 transitions. [2020-07-01 11:06:16,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2020-07-01 11:06:16,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 119 transitions. [2020-07-01 11:06:16,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-07-01 11:06:16,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-07-01 11:06:16,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 119 transitions. [2020-07-01 11:06:16,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:16,320 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 119 transitions. [2020-07-01 11:06:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 119 transitions. [2020-07-01 11:06:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2020-07-01 11:06:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-01 11:06:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-01 11:06:16,323 INFO L711 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-01 11:06:16,323 INFO L591 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-01 11:06:16,323 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-01 11:06:16,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 88 transitions. [2020-07-01 11:06:16,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2020-07-01 11:06:16,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:16,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:16,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:16,325 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2020-07-01 11:06:16,325 INFO L794 eck$LassoCheckResult]: Stem: 2346#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] 2347#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2358#L12 [2020-07-01 11:06:16,325 INFO L796 eck$LassoCheckResult]: Loop: 2358#L12 [50] 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[] 2357#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 2353#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2354#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2394#L12 [50] 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[] 2393#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2392#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2391#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2390#L12 [50] 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[] 2389#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2388#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2387#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2386#L12 [50] 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[] 2385#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2384#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2383#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2382#L12 [50] 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[] 2381#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2380#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2379#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2378#L12 [50] 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[] 2377#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2376#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2375#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2374#L12 [50] 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[] 2373#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2372#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2371#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2370#L12 [50] 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[] 2367#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2369#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2368#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2366#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] 2365#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2364#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2363#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2359#L12 [50] 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[] 2362#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2361#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2360#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2358#L12 [2020-07-01 11:06:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 9 times [2020-07-01 11:06:16,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39423330] [2020-07-01 11:06:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1605354482, now seen corresponding path program 8 times [2020-07-01 11:06:16,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104892876] [2020-07-01 11:06:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 72 proven. 105 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104892876] [2020-07-01 11:06:16,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072884604] [2020-07-01 11:06:16,426 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:16,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:06:16,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:16,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:16,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 72 proven. 105 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:16,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-07-01 11:06:16,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345233722] [2020-07-01 11:06:16,466 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:16,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:16,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 11:06:16,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:06:16,467 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-07-01 11:06:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:16,529 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2020-07-01 11:06:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:06:16,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 131 transitions. [2020-07-01 11:06:16,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 91 [2020-07-01 11:06:16,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 131 transitions. [2020-07-01 11:06:16,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-07-01 11:06:16,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-07-01 11:06:16,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 131 transitions. [2020-07-01 11:06:16,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:16,533 INFO L688 BuchiCegarLoop]: Abstraction has 124 states and 131 transitions. [2020-07-01 11:06:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 131 transitions. [2020-07-01 11:06:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2020-07-01 11:06:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-01 11:06:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2020-07-01 11:06:16,535 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 96 transitions. [2020-07-01 11:06:16,536 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 96 transitions. [2020-07-01 11:06:16,536 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-01 11:06:16,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 96 transitions. [2020-07-01 11:06:16,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-07-01 11:06:16,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:16,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:16,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:16,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2020-07-01 11:06:16,538 INFO L794 eck$LassoCheckResult]: Stem: 2682#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] 2683#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2694#L12 [2020-07-01 11:06:16,538 INFO L796 eck$LassoCheckResult]: Loop: 2694#L12 [50] 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[] 2693#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 2689#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2690#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2734#L12 [50] 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[] 2733#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2732#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2731#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2730#L12 [50] 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[] 2729#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2728#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2727#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2726#L12 [50] 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[] 2725#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2724#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2723#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2722#L12 [50] 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[] 2721#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2720#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2719#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2718#L12 [50] 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[] 2717#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2716#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2715#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2714#L12 [50] 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[] 2713#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2712#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2711#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2710#L12 [50] 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[] 2709#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2708#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2707#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2706#L12 [50] 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[] 2703#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2705#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 2704#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2702#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] 2701#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2700#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2699#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2696#L12 [50] 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[] 2698#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2697#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 2695#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2694#L12 [2020-07-01 11:06:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 10 times [2020-07-01 11:06:16,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598946960] [2020-07-01 11:06:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1758416469, now seen corresponding path program 9 times [2020-07-01 11:06:16,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088718011] [2020-07-01 11:06:16,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 136 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088718011] [2020-07-01 11:06:16,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152469750] [2020-07-01 11:06:16,643 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:16,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-07-01 11:06:16,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:16,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:06:16,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 136 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:16,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:16,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-07-01 11:06:16,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647226364] [2020-07-01 11:06:16,687 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:16,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 11:06:16,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:06:16,687 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-07-01 11:06:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:16,816 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2020-07-01 11:06:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 11:06:16,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 200 transitions. [2020-07-01 11:06:16,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2020-07-01 11:06:16,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 183 states and 198 transitions. [2020-07-01 11:06:16,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-07-01 11:06:16,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2020-07-01 11:06:16,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 198 transitions. [2020-07-01 11:06:16,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:16,821 INFO L688 BuchiCegarLoop]: Abstraction has 183 states and 198 transitions. [2020-07-01 11:06:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 198 transitions. [2020-07-01 11:06:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 132. [2020-07-01 11:06:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-01 11:06:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2020-07-01 11:06:16,825 INFO L711 BuchiCegarLoop]: Abstraction has 132 states and 147 transitions. [2020-07-01 11:06:16,825 INFO L591 BuchiCegarLoop]: Abstraction has 132 states and 147 transitions. [2020-07-01 11:06:16,825 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-01 11:06:16,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 147 transitions. [2020-07-01 11:06:16,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 130 [2020-07-01 11:06:16,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:16,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:16,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:06:16,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2020-07-01 11:06:16,828 INFO L794 eck$LassoCheckResult]: Stem: 3100#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] 3101#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3103#L12 [2020-07-01 11:06:16,829 INFO L796 eck$LassoCheckResult]: Loop: 3103#L12 [50] 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[] 3106#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 3109#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3110#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3160#L12 [50] 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[] 3159#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3158#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3157#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3156#L12 [50] 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[] 3155#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3154#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3153#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3152#L12 [50] 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[] 3151#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3150#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3149#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3148#L12 [50] 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[] 3147#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3146#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3145#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3144#L12 [50] 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[] 3143#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3142#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3141#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3140#L12 [50] 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[] 3139#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3138#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3137#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3136#L12 [50] 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[] 3135#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3134#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3133#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3132#L12 [50] 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[] 3131#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3130#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3129#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3128#L12 [50] 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[] 3124#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3127#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 3126#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3123#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] 3125#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3227#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 3120#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3118#L12 [50] 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[] 3114#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3115#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 3200#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3103#L12 [2020-07-01 11:06:16,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 11 times [2020-07-01 11:06:16,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22383842] [2020-07-01 11:06:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1754066744, now seen corresponding path program 10 times [2020-07-01 11:06:16,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020893119] [2020-07-01 11:06:16,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1481840821, now seen corresponding path program 1 times [2020-07-01 11:06:16,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:16,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990192621] [2020-07-01 11:06:16,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:16,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:17,156 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2020-07-01 11:06:17,169 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:17,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:17,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:17,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:17,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:17,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:17,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:17,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:17,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-07-01 11:06:17,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:17,170 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:17,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,247 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:17,247 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:17,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:17,255 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:17,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:17,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:17,302 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:17,332 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:17,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:17,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:17,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:17,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:17,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:17,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:17,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:17,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-07-01 11:06:17,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:17,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:17,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:17,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:17,383 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:17,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:17,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:17,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:17,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:17,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:17,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:17,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:17,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:17,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:17,394 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:06:17,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:17,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:17,398 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:17,399 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:17,399 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 4 Supporting invariants [] [2020-07-01 11:06:17,428 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 71 proven. 22 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-01 11:06:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:17,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:17,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,046 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,062 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,266 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:18,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:18,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:18,556 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-07-01 11:06:18,556 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 11 loop predicates [2020-07-01 11:06:18,556 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 132 states and 147 transitions. cyclomatic complexity: 17 Second operand 7 states. [2020-07-01 11:06:19,098 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 132 states and 147 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 3243 states and 3560 transitions. Complement of second has 659 states. [2020-07-01 11:06:19,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2020-07-01 11:06:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:06:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 94 transitions. [2020-07-01 11:06:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 94 transitions. Stem has 2 letters. Loop has 48 letters. [2020-07-01 11:06:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 94 transitions. Stem has 50 letters. Loop has 48 letters. [2020-07-01 11:06:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 94 transitions. Stem has 2 letters. Loop has 96 letters. [2020-07-01 11:06:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:19,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3243 states and 3560 transitions. [2020-07-01 11:06:19,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2020-07-01 11:06:19,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3243 states to 292 states and 319 transitions. [2020-07-01 11:06:19,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-07-01 11:06:19,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-07-01 11:06:19,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 319 transitions. [2020-07-01 11:06:19,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:19,147 INFO L688 BuchiCegarLoop]: Abstraction has 292 states and 319 transitions. [2020-07-01 11:06:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 319 transitions. [2020-07-01 11:06:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 92. [2020-07-01 11:06:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-01 11:06:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2020-07-01 11:06:19,151 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 106 transitions. [2020-07-01 11:06:19,151 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 106 transitions. [2020-07-01 11:06:19,151 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-01 11:06:19,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 106 transitions. [2020-07-01 11:06:19,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2020-07-01 11:06:19,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:19,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:19,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:06:19,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2020-07-01 11:06:19,153 INFO L794 eck$LassoCheckResult]: Stem: 13829#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] 13830#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13846#L12 [50] 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[] 13825#L12-2 [2020-07-01 11:06:19,154 INFO L796 eck$LassoCheckResult]: Loop: 13825#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13826#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 13831#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13832#L12 [50] 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[] 13836#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13857#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 13855#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13854#L12 [50] 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[] 13850#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13849#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 13847#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13844#L12 [50] 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[] 13843#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 13842#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13840#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13837#L12 [50] 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[] 13827#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13828#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13833#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13834#L12 [50] 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[] 13893#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13892#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13891#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13890#L12 [50] 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[] 13889#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13888#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13887#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13886#L12 [50] 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[] 13885#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13884#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13883#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13882#L12 [50] 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[] 13881#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13880#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13879#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13878#L12 [50] 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[] 13877#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13876#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13875#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13874#L12 [50] 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[] 13873#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13872#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13871#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13870#L12 [50] 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[] 13869#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13868#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13867#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13866#L12 [50] 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[] 13863#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13865#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 13864#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13862#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] 13853#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 13861#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 13860#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 13859#L12 [50] 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[] 13825#L12-2 [2020-07-01 11:06:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 67630, now seen corresponding path program 1 times [2020-07-01 11:06:19,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:19,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155693979] [2020-07-01 11:06:19,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,160 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -587001554, now seen corresponding path program 11 times [2020-07-01 11:06:19,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:19,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771301214] [2020-07-01 11:06:19,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 559001179, now seen corresponding path program 2 times [2020-07-01 11:06:19,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:19,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075174403] [2020-07-01 11:06:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:19,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:19,535 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2020-07-01 11:06:19,549 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:19,549 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:19,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:19,550 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:19,550 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:19,550 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:19,550 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:19,550 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:19,550 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-07-01 11:06:19,550 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:19,550 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:19,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,619 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:19,619 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:19,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:19,623 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:19,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:19,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:19,666 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:19,695 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:19,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:19,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:19,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:19,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:19,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:19,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:19,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:19,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-07-01 11:06:19,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:19,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:19,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:19,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:19,750 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:19,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:19,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:19,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:19,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:19,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:19,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:19,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:19,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:19,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:19,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:19,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:19,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:19,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:19,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:19,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:19,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:19,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:19,804 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:06:19,804 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:19,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:19,807 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:19,807 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:19,807 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2020-07-01 11:06:19,836 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:19,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:19,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:19,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:19,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-01 11:06:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:19,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:19,939 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:19,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:19,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,787 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,788 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:20,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:20,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:21,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:21,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:21,499 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 17 predicates after loop cannibalization [2020-07-01 11:06:21,499 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 17 loop predicates [2020-07-01 11:06:21,500 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 92 states and 106 transitions. cyclomatic complexity: 16 Second operand 9 states. [2020-07-01 11:06:23,135 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 92 states and 106 transitions. cyclomatic complexity: 16. Second operand 9 states. Result 11135 states and 12483 transitions. Complement of second has 3053 states. [2020-07-01 11:06:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 44 states 1 stem states 41 non-accepting loop states 1 accepting loop states [2020-07-01 11:06:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 11:06:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 175 transitions. [2020-07-01 11:06:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 175 transitions. Stem has 3 letters. Loop has 56 letters. [2020-07-01 11:06:23,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:23,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 175 transitions. Stem has 59 letters. Loop has 56 letters. [2020-07-01 11:06:23,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:23,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 175 transitions. Stem has 3 letters. Loop has 112 letters. [2020-07-01 11:06:23,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:23,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11135 states and 12483 transitions. [2020-07-01 11:06:23,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 231 [2020-07-01 11:06:23,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11135 states to 571 states and 625 transitions. [2020-07-01 11:06:23,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-07-01 11:06:23,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2020-07-01 11:06:23,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 571 states and 625 transitions. [2020-07-01 11:06:23,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:23,240 INFO L688 BuchiCegarLoop]: Abstraction has 571 states and 625 transitions. [2020-07-01 11:06:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states and 625 transitions. [2020-07-01 11:06:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 100. [2020-07-01 11:06:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-01 11:06:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2020-07-01 11:06:23,246 INFO L711 BuchiCegarLoop]: Abstraction has 100 states and 116 transitions. [2020-07-01 11:06:23,246 INFO L591 BuchiCegarLoop]: Abstraction has 100 states and 116 transitions. [2020-07-01 11:06:23,247 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2020-07-01 11:06:23,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 116 transitions. [2020-07-01 11:06:23,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-07-01 11:06:23,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:23,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:23,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:06:23,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2020-07-01 11:06:23,249 INFO L794 eck$LassoCheckResult]: Stem: 37310#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] 37311#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37327#L12 [50] 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[] 37333#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~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 [2020-07-01 11:06:23,250 INFO L796 eck$LassoCheckResult]: Loop: 37320#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37312#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37313#L12 [50] 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[] 37316#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37307#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37353#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~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 [50] 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[] 37348#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37347#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37346#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37344#L12 [50] 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[] 37339#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37338#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37336#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37335#L12 [50] 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[] 37332#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37329#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37328#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37325#L12 [50] 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[] 37324#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 37323#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37321#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37317#L12 [50] 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[] 37308#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37309#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37314#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37315#L12 [50] 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[] 37405#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37404#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37403#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37402#L12 [50] 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[] 37401#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37400#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37399#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37398#L12 [50] 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[] 37397#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37396#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37395#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37394#L12 [50] 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[] 37393#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37392#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37391#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37390#L12 [50] 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[] 37389#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37388#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37387#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37386#L12 [50] 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[] 37385#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37384#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37383#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37382#L12 [50] 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[] 37381#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37380#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37379#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37378#L12 [50] 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[] 37375#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37377#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 37376#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37374#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] 37371#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37373#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 37372#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37370#L12 [50] 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[] 37354#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~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 [2020-07-01 11:06:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:23,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2096581, now seen corresponding path program 1 times [2020-07-01 11:06:23,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:23,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153310016] [2020-07-01 11:06:23,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1212886432, now seen corresponding path program 12 times [2020-07-01 11:06:23,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:23,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518905697] [2020-07-01 11:06:23,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash 307236, now seen corresponding path program 3 times [2020-07-01 11:06:23,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:23,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535890534] [2020-07-01 11:06:23,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:23,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:23,713 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 62 [2020-07-01 11:06:23,726 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:23,726 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:23,727 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:23,727 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:23,727 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:23,727 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:23,727 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:23,727 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:23,727 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-07-01 11:06:23,727 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:23,727 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:23,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,786 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:23,787 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:23,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:23,790 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:23,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:23,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:23,831 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:23,860 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:23,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:23,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:23,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:23,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:23,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:23,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:23,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:23,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-07-01 11:06:23,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:23,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:23,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:23,924 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:23,924 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:23,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:23,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:23,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:23,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:23,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:23,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:23,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:23,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:23,933 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:23,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:06:23,936 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:23,940 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:23,940 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:23,940 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:23,940 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2020-07-01 11:06:23,969 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:23,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:23,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:23,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:23,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 236 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-01 11:06:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,457 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:24,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:24,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:26,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:26,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:26,439 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 23 predicates after loop cannibalization [2020-07-01 11:06:26,439 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 23 loop predicates [2020-07-01 11:06:26,440 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 100 states and 116 transitions. cyclomatic complexity: 19 Second operand 10 states. [2020-07-01 11:06:31,256 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 100 states and 116 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 96000 states and 110650 transitions. Complement of second has 15478 states. [2020-07-01 11:06:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 73 states 1 stem states 70 non-accepting loop states 1 accepting loop states [2020-07-01 11:06:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:06:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 295 transitions. [2020-07-01 11:06:31,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 295 transitions. Stem has 4 letters. Loop has 64 letters. [2020-07-01 11:06:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 295 transitions. Stem has 68 letters. Loop has 64 letters. [2020-07-01 11:06:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 295 transitions. Stem has 4 letters. Loop has 128 letters. [2020-07-01 11:06:31,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:06:31,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96000 states and 110650 transitions. [2020-07-01 11:06:31,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 300 [2020-07-01 11:06:31,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96000 states to 1052 states and 1130 transitions. [2020-07-01 11:06:31,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2020-07-01 11:06:31,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2020-07-01 11:06:31,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1052 states and 1130 transitions. [2020-07-01 11:06:31,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:06:31,688 INFO L688 BuchiCegarLoop]: Abstraction has 1052 states and 1130 transitions. [2020-07-01 11:06:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states and 1130 transitions. [2020-07-01 11:06:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 105. [2020-07-01 11:06:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-01 11:06:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2020-07-01 11:06:31,695 INFO L711 BuchiCegarLoop]: Abstraction has 105 states and 122 transitions. [2020-07-01 11:06:31,695 INFO L591 BuchiCegarLoop]: Abstraction has 105 states and 122 transitions. [2020-07-01 11:06:31,695 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2020-07-01 11:06:31,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 122 transitions. [2020-07-01 11:06:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-07-01 11:06:31,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:31,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:31,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:06:31,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2020-07-01 11:06:31,697 INFO L794 eck$LassoCheckResult]: Stem: 160997#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] 160998#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161014#L12 [50] 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[] 161016#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161087#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 160999#L18-1 [2020-07-01 11:06:31,698 INFO L796 eck$LassoCheckResult]: Loop: 160999#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161000#L12 [50] 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[] 161035#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161034#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161001#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161002#L12 [50] 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[] 160996#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 160995#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161006#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161094#L12 [50] 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[] 161093#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161092#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161091#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161088#L12 [50] 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[] 161086#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161046#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161045#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161044#L12 [50] 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[] 161043#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161041#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161039#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161038#L12 [50] 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[] 161036#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161031#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161030#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161029#L12 [50] 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[] 161027#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 161022#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161020#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161021#L12 [50] 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[] 161085#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161084#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161083#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161082#L12 [50] 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[] 161081#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161080#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161079#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161078#L12 [50] 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[] 161077#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161076#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161075#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161074#L12 [50] 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[] 161073#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161072#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161071#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161070#L12 [50] 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[] 161069#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161068#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161067#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161066#L12 [50] 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[] 161065#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161064#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161063#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161062#L12 [50] 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[] 161061#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161060#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161059#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161058#L12 [50] 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[] 161057#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161056#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161055#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161054#L12 [50] 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[] 161051#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161053#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 161052#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161050#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] 161048#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161049#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 161010#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 161047#L12 [50] 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[] 161042#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 161007#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 160999#L18-1 [2020-07-01 11:06:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash 64994063, now seen corresponding path program 2 times [2020-07-01 11:06:31,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:31,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058738073] [2020-07-01 11:06:31,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1382411798, now seen corresponding path program 13 times [2020-07-01 11:06:31,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:31,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180651629] [2020-07-01 11:06:31,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 598297380, now seen corresponding path program 4 times [2020-07-01 11:06:31,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:31,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836608416] [2020-07-01 11:06:31,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:31,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:32,193 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 68 [2020-07-01 11:06:32,206 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:32,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:32,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:32,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:32,206 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:06:32,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:32,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:32,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-07-01 11:06:32,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:32,207 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:32,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,266 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:32,266 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:32,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:32,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:32,274 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:32,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:32,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:32,311 INFO L440 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: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:32,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:32,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:06:32,348 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:06:32,381 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:06:32,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:06:32,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:06:32,422 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:06:32,451 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:06:32,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:06:32,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:06:32,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:06:32,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:06:32,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:06:32,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:06:32,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-07-01 11:06:32,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:06:32,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:06:32,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:06:32,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:06:32,513 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:32,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:32,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:32,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:32,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:32,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:32,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:32,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:32,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:32,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:32,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:32,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:32,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:06:32,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:06:32,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:32,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:32,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:32,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:32,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:32,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:32,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:32,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:32,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:06:32,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:06:32,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:06:32,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:06:32,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:06:32,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:06:32,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:06:32,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:06:32,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:06:32,645 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:06:32,646 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:06:32,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:06:32,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:06:32,648 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:06:32,649 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2020-07-01 11:06:32,678 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:06:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 98 proven. 343 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-01 11:06:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:32,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:32,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:33,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:33,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,486 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:34,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:34,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,166 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:35,559 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:06:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:35,579 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:06:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,596 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,652 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,677 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:35,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:06:35,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:35,752 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 28 predicates after loop cannibalization [2020-07-01 11:06:35,752 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 [2020-07-01 11:06:35,753 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 105 states and 122 transitions. cyclomatic complexity: 19 Second operand 12 states. [2020-07-01 11:07:00,483 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 105 states and 122 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 549975 states and 607981 transitions. Complement of second has 90693 states. [2020-07-01 11:07:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 103 states 1 stem states 100 non-accepting loop states 1 accepting loop states [2020-07-01 11:07:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 11:07:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 409 transitions. [2020-07-01 11:07:00,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 103 states and 409 transitions. Stem has 5 letters. Loop has 72 letters. [2020-07-01 11:07:00,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:07:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 103 states and 409 transitions. Stem has 77 letters. Loop has 72 letters. [2020-07-01 11:07:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:07:00,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 103 states and 409 transitions. Stem has 5 letters. Loop has 144 letters. [2020-07-01 11:07:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:07:00,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549975 states and 607981 transitions. [2020-07-01 11:07:02,262 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 325 [2020-07-01 11:07:02,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549975 states to 1343 states and 1409 transitions. [2020-07-01 11:07:02,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-07-01 11:07:02,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2020-07-01 11:07:02,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1343 states and 1409 transitions. [2020-07-01 11:07:02,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:07:02,271 INFO L688 BuchiCegarLoop]: Abstraction has 1343 states and 1409 transitions. [2020-07-01 11:07:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states and 1409 transitions. [2020-07-01 11:07:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 153. [2020-07-01 11:07:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-01 11:07:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2020-07-01 11:07:02,279 INFO L711 BuchiCegarLoop]: Abstraction has 153 states and 173 transitions. [2020-07-01 11:07:02,280 INFO L591 BuchiCegarLoop]: Abstraction has 153 states and 173 transitions. [2020-07-01 11:07:02,280 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2020-07-01 11:07:02,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 173 transitions. [2020-07-01 11:07:02,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-07-01 11:07:02,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:07:02,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:07:02,281 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-01 11:07:02,281 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2020-07-01 11:07:02,281 INFO L794 eck$LassoCheckResult]: Stem: 816749#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] 816750#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816764#L12 [50] 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[] 816766#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816874#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816886#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816816#L12 [2020-07-01 11:07:02,282 INFO L796 eck$LassoCheckResult]: Loop: 816816#L12 [50] 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[] 816815#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816759#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816751#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816752#L12 [50] 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[] 816747#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816748#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816753#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816754#L12 [50] 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[] 816897#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816892#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816891#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816890#L12 [50] 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[] 816887#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816879#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816884#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816883#L12 [50] 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[] 816882#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816881#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816880#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816875#L12 [50] 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[] 816872#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816835#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816833#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816832#L12 [50] 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[] 816826#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816824#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816822#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816821#L12 [50] 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[] 816820#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816814#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816813#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816812#L12 [50] 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[] 816811#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= 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] 816769#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816757#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816758#L12 [50] 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[] 816871#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816870#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816869#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816868#L12 [50] 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[] 816867#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816866#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816865#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816864#L12 [50] 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[] 816863#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816862#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816861#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816860#L12 [50] 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[] 816859#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816858#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816857#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816856#L12 [50] 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[] 816855#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816854#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816853#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816852#L12 [50] 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[] 816851#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816850#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816849#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816848#L12 [50] 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[] 816847#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816846#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816845#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816844#L12 [50] 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[] 816843#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816842#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816841#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816840#L12 [50] 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[] 816837#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816839#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) 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] 816838#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816836#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] 816828#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816831#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816829#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816827#L12 [50] 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[] 816825#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 816818#L15-1 [52] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) 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] 816817#L18-1 [41] L18-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~i~0_7 10)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 816816#L12 [2020-07-01 11:07:02,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:02,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2014815994, now seen corresponding path program 3 times [2020-07-01 11:07:02,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:02,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866808248] [2020-07-01 11:07:02,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:07:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1334967416, now seen corresponding path program 14 times [2020-07-01 11:07:02,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:02,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583017442] [2020-07-01 11:07:02,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:07:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:07:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2056107663, now seen corresponding path program 5 times [2020-07-01 11:07:02,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:07:02,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017809080] [2020-07-01 11:07:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:07:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:07:02,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:07:02,806 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 74 [2020-07-01 11:07:02,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:07:02 BasicIcfg [2020-07-01 11:07:02,867 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:07:02,869 INFO L168 Benchmark]: Toolchain (without parser) took 51340.24 ms. Allocated memory was 514.9 MB in the beginning and 4.0 GB in the end (delta: 3.5 GB). Free memory was 439.3 MB in the beginning and 857.7 MB in the end (delta: -418.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,869 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:07:02,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.35 ms. Allocated memory was 514.9 MB in the beginning and 552.6 MB in the end (delta: 37.7 MB). Free memory was 439.3 MB in the beginning and 520.6 MB in the end (delta: -81.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.84 ms. Allocated memory is still 552.6 MB. Free memory was 520.6 MB in the beginning and 519.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,870 INFO L168 Benchmark]: Boogie Preprocessor took 19.81 ms. Allocated memory is still 552.6 MB. Free memory was 519.2 MB in the beginning and 517.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,871 INFO L168 Benchmark]: RCFGBuilder took 231.14 ms. Allocated memory is still 552.6 MB. Free memory was 517.9 MB in the beginning and 506.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,871 INFO L168 Benchmark]: BlockEncodingV2 took 69.27 ms. Allocated memory is still 552.6 MB. Free memory was 506.0 MB in the beginning and 500.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,872 INFO L168 Benchmark]: TraceAbstraction took 160.51 ms. Allocated memory is still 552.6 MB. Free memory was 499.9 MB in the beginning and 491.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,872 INFO L168 Benchmark]: BuchiAutomizer took 50541.38 ms. Allocated memory was 552.6 MB in the beginning and 4.0 GB in the end (delta: 3.5 GB). Free memory was 491.7 MB in the beginning and 857.7 MB in the end (delta: -366.0 MB). Peak memory consumption was 3.1 GB. Max. memory is 50.3 GB. [2020-07-01 11:07:02,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 279.35 ms. Allocated memory was 514.9 MB in the beginning and 552.6 MB in the end (delta: 37.7 MB). Free memory was 439.3 MB in the beginning and 520.6 MB in the end (delta: -81.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.84 ms. Allocated memory is still 552.6 MB. Free memory was 520.6 MB in the beginning and 519.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.81 ms. Allocated memory is still 552.6 MB. Free memory was 519.2 MB in the beginning and 517.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 231.14 ms. Allocated memory is still 552.6 MB. Free memory was 517.9 MB in the beginning and 506.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 69.27 ms. Allocated memory is still 552.6 MB. Free memory was 506.0 MB in the beginning and 500.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 160.51 ms. Allocated memory is still 552.6 MB. Free memory was 499.9 MB in the beginning and 491.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 50541.38 ms. Allocated memory was 552.6 MB in the beginning and 4.0 GB in the end (delta: 3.5 GB). Free memory was 491.7 MB in the beginning and 857.7 MB in the end (delta: -366.0 MB). Peak memory consumption was 3.1 GB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, 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 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 - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (12 trivial, 0 deterministic, 7 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * i + 4 and consists of 22 locations. One nondeterministic module has affine ranking function -1 * i + 6 and consists of 44 locations. One nondeterministic module has affine ranking function -1 * i + 7 and consists of 73 locations. One nondeterministic module has affine ranking function -1 * i + 7 and consists of 103 locations. 12 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 153 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.4s and 18 iterations. TraceHistogramMax:20. Analysis of lassos took 6.4s. Construction of modules took 1.7s. Büchi inclusion checks took 39.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 19. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 3136 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 2.3s Buchi closure took 0.0s. Biggest automaton had 153 states and ocurred in iteration 17. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 978/1720 HoareTripleCheckerStatistics: 86 SDtfs, 888 SDslu, 9 SDs, 0 SdLazy, 2176 SolverSat, 490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq125 hnf97 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@384ea0cb=0, \result=0, i=8} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 11:06:05.866 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Xk34TT/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:07:04.718 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check