NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:40:52,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:40:52,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:40:52,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:40:52,955 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:40:52,956 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:40:52,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:40:52,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:40:52,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:40:52,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:40:52,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:40:52,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:40:52,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:40:52,964 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:40:52,965 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:40:52,966 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:40:52,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:40:52,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:40:52,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:40:52,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:40:52,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:40:52,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:40:52,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:40:52,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:40:52,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:40:52,977 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:40:52,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:40:52,978 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:40:52,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:40:52,979 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:40:52,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:40:52,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:40:52,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:40:52,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:40:52,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:40:52,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:40:52,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:40:52,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:40:52,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:40:52,984 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 06:40:52,999 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:40:52,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:40:53,000 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:40:53,000 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:40:53,000 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:40:53,001 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:40:53,001 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:40:53,001 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:40:53,001 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:40:53,001 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:40:53,001 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:40:53,002 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:40:53,002 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:40:53,002 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:40:53,002 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:53,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:40:53,002 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:40:53,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:40:53,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:40:53,003 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:40:53,003 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:40:53,003 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:40:53,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:40:53,004 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:40:53,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:40:53,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:40:53,004 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:40:53,004 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:40:53,005 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:40:53,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:40:53,043 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:40:53,047 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:40:53,048 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:40:53,049 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:40:53,050 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:40:53,118 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/29598747bceb483fab8a62f1a43a8bf4/FLAG0ecbb634f [2020-06-22 06:40:53,453 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:40:53,454 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:40:53,460 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/29598747bceb483fab8a62f1a43a8bf4/FLAG0ecbb634f [2020-06-22 06:40:53,878 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/29598747bceb483fab8a62f1a43a8bf4 [2020-06-22 06:40:53,890 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:40:53,891 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:40:53,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:40:53,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:40:53,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:40:53,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:40:53" (1/1) ... [2020-06-22 06:40:53,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbaa2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:53, skipping insertion in model container [2020-06-22 06:40:53,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:40:53" (1/1) ... [2020-06-22 06:40:53,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:40:53,926 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:40:54,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:40:54,088 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:40:54,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:40:54,176 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:40:54,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54 WrapperNode [2020-06-22 06:40:54,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:40:54,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:40:54,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:40:54,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:40:54,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:40:54,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:40:54,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:40:54,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:40:54,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:40:54,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:40:54,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:40:54,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:40:54,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (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-06-22 06:40:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:40:54,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:40:54,451 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:40:54,451 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 06:40:54,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:40:54 BoogieIcfgContainer [2020-06-22 06:40:54,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:40:54,453 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:40:54,453 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:40:54,455 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:40:54,456 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:40:54" (1/1) ... [2020-06-22 06:40:54,472 INFO L313 BlockEncoder]: Initial Icfg 12 locations, 19 edges [2020-06-22 06:40:54,473 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:40:54,474 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:40:54,475 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:40:54,475 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:40:54,477 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:40:54,478 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:40:54,479 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:40:54,496 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:40:54,512 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 06:40:54,517 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 06:40:54,518 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:40:54,531 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 06:40:54,533 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 06:40:54,534 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:40:54,534 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:40:54,535 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:40:54,535 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:40:54,535 INFO L313 BlockEncoder]: Encoded RCFG 8 locations, 15 edges [2020-06-22 06:40:54,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:40:54 BasicIcfg [2020-06-22 06:40:54,536 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:40:54,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:40:54,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:40:54,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:40:54,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:40:53" (1/4) ... [2020-06-22 06:40:54,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (2/4) ... [2020-06-22 06:40:54,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:40:54" (3/4) ... [2020-06-22 06:40:54,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:40:54" (4/4) ... [2020-06-22 06:40:54,545 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:40:54,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:40:54,564 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:40:54,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:40:54,612 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:40:54,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:40:54,613 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:40:54,613 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:40:54,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:40:54,613 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:40:54,613 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:40:54,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:40:54,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:40:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2020-06-22 06:40:54,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:40:54,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-06-22 06:40:54,685 INFO L451 ceAbstractionStarter]: At program point L34-2(lines 11 42) the Hoare annotation is: true [2020-06-22 06:40:54,685 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-06-22 06:40:54,686 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 23) no Hoare annotation was computed. [2020-06-22 06:40:54,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:40:54,686 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 40) no Hoare annotation was computed. [2020-06-22 06:40:54,686 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-06-22 06:40:54,687 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 39) no Hoare annotation was computed. [2020-06-22 06:40:54,687 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 38) no Hoare annotation was computed. [2020-06-22 06:40:54,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:40:54 BasicIcfg [2020-06-22 06:40:54,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:40:54,696 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:40:54,696 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:40:54,699 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:40:54,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:40:54,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:40:53" (1/5) ... [2020-06-22 06:40:54,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25505a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,701 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:40:54,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:40:54" (2/5) ... [2020-06-22 06:40:54,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25505a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:40:54,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:40:54" (3/5) ... [2020-06-22 06:40:54,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25505a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:40:54,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:40:54" (4/5) ... [2020-06-22 06:40:54,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25505a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:40:54, skipping insertion in model container [2020-06-22 06:40:54,703 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:40:54,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:40:54" (5/5) ... [2020-06-22 06:40:54,705 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:40:54,731 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:40:54,732 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:40:54,732 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:40:54,732 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:40:54,732 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:40:54,732 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:40:54,732 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:40:54,733 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:40:54,733 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:40:54,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-06-22 06:40:54,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:40:54,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:54,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:54,762 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:40:54,762 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:40:54,762 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:40:54,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-06-22 06:40:54,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:40:54,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:54,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:54,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:40:54,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:40:54,769 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4#L34-2true [2020-06-22 06:40:54,769 INFO L796 eck$LassoCheckResult]: Loop: 4#L34-2true [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 7#L12true [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9#L14true [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4#L34-2true [2020-06-22 06:40:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2020-06-22 06:40:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 84579, now seen corresponding path program 1 times [2020-06-22 06:40:54,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:54,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2527441, now seen corresponding path program 1 times [2020-06-22 06:40:54,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:54,943 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:54,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:54,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:54,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:54,945 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:54,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:54,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:54,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:54,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:40:54,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:54,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:54,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:54,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:54,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:55,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:55,078 INFO L412 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-06-22 06:40:55,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:55,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:55,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:55,119 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-06-22 06:40:55,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:55,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:55,154 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:55,154 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-06-22 06:40:55,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:55,159 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-06-22 06:40:55,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:40:55,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:55,231 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:40:55,233 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:55,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:55,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:55,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:55,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:40:55,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:40:55,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:55,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:55,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:40:55,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:55,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:55,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:55,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:55,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:55,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:55,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:40:55,326 INFO L122 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-06-22 06:40:55,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:55,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:55,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:55,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:55,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:40:55,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:40:55,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:40:55,341 INFO L122 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-06-22 06:40:55,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:55,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:55,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:55,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:55,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:40:55,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:40:55,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:40:55,353 INFO L122 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-06-22 06:40:55,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:55,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:40:55,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:55,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:55,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:55,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:40:55,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:40:55,365 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:40:55,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:40:55,374 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:40:55,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:40:55,377 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:40:55,377 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:40:55,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 06:40:55,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:40:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:40:55,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:40:55,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:40:55,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:55,480 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:40:55,486 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 06:40:55,487 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states. Second operand 3 states. [2020-06-22 06:40:55,613 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states.. Second operand 3 states. Result 40 states and 70 transitions. Complement of second has 6 states. [2020-06-22 06:40:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 06:40:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 06:40:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-06-22 06:40:55,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 06:40:55,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:55,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 06:40:55,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:55,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 06:40:55,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:55,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 70 transitions. [2020-06-22 06:40:55,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 06:40:55,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 70 transitions. [2020-06-22 06:40:55,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 06:40:55,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 06:40:55,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 70 transitions. [2020-06-22 06:40:55,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:55,638 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 70 transitions. [2020-06-22 06:40:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 70 transitions. [2020-06-22 06:40:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-06-22 06:40:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 06:40:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-06-22 06:40:55,671 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-06-22 06:40:55,672 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-06-22 06:40:55,672 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:40:55,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 66 transitions. [2020-06-22 06:40:55,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 06:40:55,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:55,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:55,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:40:55,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 06:40:55,674 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 102#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 [2020-06-22 06:40:55,675 INFO L796 eck$LassoCheckResult]: Loop: 120#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 124#L25 [69] L25-->L27: Formula: (and (< v_ULTIMATE.start_main_~j~0_23 0) (< 0 v_ULTIMATE.start_main_~i~0_21) (= v_ULTIMATE.start_main_~i~0_20 (+ v_ULTIMATE.start_main_~i~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 125#L27 [76] L27-->L34-2: Formula: (and (>= (+ v_ULTIMATE.start_main_~j~0_8 1) 0) (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 130#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 [2020-06-22 06:40:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 1 times [2020-06-22 06:40:55,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 3137193, now seen corresponding path program 1 times [2020-06-22 06:40:55,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 06:40:55,723 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:40:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:40:55,726 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-06-22 06:40:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:55,757 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. [2020-06-22 06:40:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:40:55,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. [2020-06-22 06:40:55,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 06:40:55,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 53 transitions. [2020-06-22 06:40:55,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 06:40:55,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 06:40:55,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 53 transitions. [2020-06-22 06:40:55,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:55,764 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-06-22 06:40:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 53 transitions. [2020-06-22 06:40:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 06:40:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 06:40:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2020-06-22 06:40:55,768 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-06-22 06:40:55,768 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-06-22 06:40:55,768 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:40:55,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 53 transitions. [2020-06-22 06:40:55,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 06:40:55,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:55,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:55,770 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:40:55,770 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:40:55,770 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 170#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 [2020-06-22 06:40:55,771 INFO L796 eck$LassoCheckResult]: Loop: 172#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 178#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 197#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 183#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 200#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 199#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 175#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 171#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 [2020-06-22 06:40:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 2 times [2020-06-22 06:40:55,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1482931300, now seen corresponding path program 1 times [2020-06-22 06:40:55,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:55,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:55,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 06:40:55,823 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 06:40:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 06:40:55,824 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. cyclomatic complexity: 24 Second operand 6 states. [2020-06-22 06:40:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:55,912 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2020-06-22 06:40:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 06:40:55,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 82 transitions. [2020-06-22 06:40:55,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2020-06-22 06:40:55,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 81 transitions. [2020-06-22 06:40:55,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 06:40:55,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-06-22 06:40:55,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 81 transitions. [2020-06-22 06:40:55,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:55,919 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 81 transitions. [2020-06-22 06:40:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 81 transitions. [2020-06-22 06:40:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-06-22 06:40:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 06:40:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-06-22 06:40:55,926 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-06-22 06:40:55,926 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-06-22 06:40:55,926 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 06:40:55,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 67 transitions. [2020-06-22 06:40:55,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-06-22 06:40:55,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:55,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:55,928 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 06:40:55,928 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2020-06-22 06:40:55,929 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 270#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 294#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 [2020-06-22 06:40:55,929 INFO L796 eck$LassoCheckResult]: Loop: 272#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 285#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 287#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 286#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 282#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 283#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 296#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 271#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 [2020-06-22 06:40:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 81540, now seen corresponding path program 1 times [2020-06-22 06:40:55,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:55,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 06:40:55,949 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 06:40:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1585548461, now seen corresponding path program 1 times [2020-06-22 06:40:55,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:55,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 06:40:55,972 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:40:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:40:55,972 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. cyclomatic complexity: 27 Second operand 3 states. [2020-06-22 06:40:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:55,998 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-06-22 06:40:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:40:56,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 67 transitions. [2020-06-22 06:40:56,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-06-22 06:40:56,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 67 transitions. [2020-06-22 06:40:56,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-06-22 06:40:56,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 06:40:56,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. [2020-06-22 06:40:56,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:56,004 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-06-22 06:40:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. [2020-06-22 06:40:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 06:40:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 06:40:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2020-06-22 06:40:56,008 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-06-22 06:40:56,008 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-06-22 06:40:56,009 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 06:40:56,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 67 transitions. [2020-06-22 06:40:56,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-06-22 06:40:56,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:56,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:56,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 06:40:56,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 06:40:56,011 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 363#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 364#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 365#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 [2020-06-22 06:40:56,012 INFO L796 eck$LassoCheckResult]: Loop: 372#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 368#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 391#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 389#L25 [78] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= 0 v_ULTIMATE.start_main_~i~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 367#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 369#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 400#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 399#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 361#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 357#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 358#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 395#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 [2020-06-22 06:40:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2527434, now seen corresponding path program 1 times [2020-06-22 06:40:56,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1715145731, now seen corresponding path program 1 times [2020-06-22 06:40:56,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 06:40:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 06:40:56,040 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:40:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:40:56,041 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. cyclomatic complexity: 26 Second operand 3 states. [2020-06-22 06:40:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:56,060 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2020-06-22 06:40:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:40:56,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2020-06-22 06:40:56,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 06:40:56,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 53 transitions. [2020-06-22 06:40:56,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 06:40:56,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 06:40:56,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 53 transitions. [2020-06-22 06:40:56,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:56,066 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. [2020-06-22 06:40:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 53 transitions. [2020-06-22 06:40:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-06-22 06:40:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 06:40:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2020-06-22 06:40:56,070 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. [2020-06-22 06:40:56,070 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. [2020-06-22 06:40:56,070 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 06:40:56,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 53 transitions. [2020-06-22 06:40:56,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 06:40:56,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:56,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:56,072 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 06:40:56,072 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 06:40:56,072 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 446#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 469#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 460#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 461#L16 [2020-06-22 06:40:56,073 INFO L796 eck$LassoCheckResult]: Loop: 461#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 447#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 448#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 463#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 457#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 458#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 481#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 480#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 451#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 452#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 479#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 476#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 461#L16 [2020-06-22 06:40:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2527434, now seen corresponding path program 2 times [2020-06-22 06:40:56,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:56,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -92308732, now seen corresponding path program 1 times [2020-06-22 06:40:56,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:56,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -366074291, now seen corresponding path program 1 times [2020-06-22 06:40:56,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:56,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:56,228 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:56,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:56,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:56,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:56,229 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:56,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:56,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:56,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:56,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 06:40:56,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:56,230 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:56,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,323 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:56,323 INFO L412 LassoAnalysis]: Checking for nontermination... 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-06-22 06:40:56,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:56,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:56,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:56,359 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:56,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:56,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:56,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:56,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:56,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:56,405 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:56,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:40:56,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:56,469 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:40:56,471 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:56,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:56,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:56,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:56,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:40:56,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:40:56,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:56,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:56,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 06:40:56,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:56,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:56,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:56,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:56,541 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:40:56,541 INFO L122 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-06-22 06:40:56,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:56,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:56,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:56,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:56,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:40:56,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:40:56,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:40:56,548 INFO L122 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-06-22 06:40:56,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:56,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:56,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:56,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:56,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:40:56,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:40:56,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:40:56,554 INFO L122 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-06-22 06:40:56,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:56,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:40:56,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:56,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:56,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:56,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:40:56,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:40:56,562 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:40:56,566 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:40:56,566 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:40:56,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:40:56,566 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:40:56,566 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:40:56,567 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 7 Supporting invariants [] [2020-06-22 06:40:56,567 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:40:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:56,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:56,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:57,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:57,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,058 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 06:40:57,059 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-06-22 06:40:57,059 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 37 states and 53 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-06-22 06:40:57,235 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 37 states and 53 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 272 states and 399 transitions. Complement of second has 37 states. [2020-06-22 06:40:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 06:40:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:40:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-06-22 06:40:57,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 06:40:57,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:57,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 06:40:57,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:57,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 06:40:57,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:57,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 399 transitions. [2020-06-22 06:40:57,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 220 [2020-06-22 06:40:57,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 242 states and 355 transitions. [2020-06-22 06:40:57,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-06-22 06:40:57,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2020-06-22 06:40:57,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 355 transitions. [2020-06-22 06:40:57,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,252 INFO L706 BuchiCegarLoop]: Abstraction has 242 states and 355 transitions. [2020-06-22 06:40:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 355 transitions. [2020-06-22 06:40:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 171. [2020-06-22 06:40:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-06-22 06:40:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2020-06-22 06:40:57,265 INFO L729 BuchiCegarLoop]: Abstraction has 171 states and 256 transitions. [2020-06-22 06:40:57,265 INFO L609 BuchiCegarLoop]: Abstraction has 171 states and 256 transitions. [2020-06-22 06:40:57,265 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 06:40:57,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 256 transitions. [2020-06-22 06:40:57,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2020-06-22 06:40:57,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,267 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 06:40:57,267 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2020-06-22 06:40:57,268 INFO L794 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1103#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1197#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1120#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1121#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1099#L34-2 [2020-06-22 06:40:57,268 INFO L796 eck$LassoCheckResult]: Loop: 1099#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1262#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1260#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1259#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1256#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1244#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1240#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1239#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1099#L34-2 [2020-06-22 06:40:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 1 times [2020-06-22 06:40:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1355184017, now seen corresponding path program 1 times [2020-06-22 06:40:57,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:40:57,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:40:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:40:57,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:40:57,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-06-22 06:40:57,377 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 06:40:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 06:40:57,378 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. cyclomatic complexity: 87 Second operand 8 states. [2020-06-22 06:40:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:57,422 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2020-06-22 06:40:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 06:40:57,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 220 transitions. [2020-06-22 06:40:57,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 [2020-06-22 06:40:57,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 147 states and 214 transitions. [2020-06-22 06:40:57,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2020-06-22 06:40:57,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-06-22 06:40:57,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 214 transitions. [2020-06-22 06:40:57,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,429 INFO L706 BuchiCegarLoop]: Abstraction has 147 states and 214 transitions. [2020-06-22 06:40:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 214 transitions. [2020-06-22 06:40:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2020-06-22 06:40:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-06-22 06:40:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2020-06-22 06:40:57,437 INFO L729 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. [2020-06-22 06:40:57,437 INFO L609 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. [2020-06-22 06:40:57,437 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 06:40:57,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 210 transitions. [2020-06-22 06:40:57,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2020-06-22 06:40:57,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,440 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 06:40:57,440 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2, 2, 2, 2, 2, 1] [2020-06-22 06:40:57,441 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1452#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1574#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1572#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1457#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1459#L34-2 [2020-06-22 06:40:57,441 INFO L796 eck$LassoCheckResult]: Loop: 1459#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1547#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1527#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1546#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1544#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1542#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1540#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1526#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1570#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1473#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1474#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1591#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1589#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1590#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1557#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1495#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1553#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1551#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1510#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1459#L34-2 [2020-06-22 06:40:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 2 times [2020-06-22 06:40:57,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1673482209, now seen corresponding path program 1 times [2020-06-22 06:40:57,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:57,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 06:40:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:57,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 06:40:57,483 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:57,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 06:40:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 06:40:57,484 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. cyclomatic complexity: 69 Second operand 4 states. [2020-06-22 06:40:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:57,518 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2020-06-22 06:40:57,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 06:40:57,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 191 transitions. [2020-06-22 06:40:57,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2020-06-22 06:40:57,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 136 states and 191 transitions. [2020-06-22 06:40:57,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-06-22 06:40:57,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-06-22 06:40:57,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. [2020-06-22 06:40:57,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,525 INFO L706 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2020-06-22 06:40:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. [2020-06-22 06:40:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2020-06-22 06:40:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-06-22 06:40:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 188 transitions. [2020-06-22 06:40:57,531 INFO L729 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. [2020-06-22 06:40:57,531 INFO L609 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. [2020-06-22 06:40:57,532 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 06:40:57,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 188 transitions. [2020-06-22 06:40:57,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2020-06-22 06:40:57,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,533 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 06:40:57,534 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 3, 3, 2, 2, 2] [2020-06-22 06:40:57,534 INFO L794 eck$LassoCheckResult]: Stem: 1737#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1738#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1845#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1843#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1842#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1841#L34-2 [2020-06-22 06:40:57,534 INFO L796 eck$LassoCheckResult]: Loop: 1841#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1759#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1760#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1864#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1863#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1861#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1860#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1859#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1858#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1856#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1853#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1855#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1854#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1852#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1851#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1850#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1768#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1830#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1831#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1840#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1841#L34-2 [2020-06-22 06:40:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 3 times [2020-06-22 06:40:57,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash -536379552, now seen corresponding path program 2 times [2020-06-22 06:40:57,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:57,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:40:57,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:40:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 06:40:57,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 06:40:57,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:40:57,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:40:57,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:40:57,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 06:40:57,658 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 06:40:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-06-22 06:40:57,658 INFO L87 Difference]: Start difference. First operand 133 states and 188 transitions. cyclomatic complexity: 57 Second operand 8 states. [2020-06-22 06:40:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:57,754 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2020-06-22 06:40:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 06:40:57,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 279 transitions. [2020-06-22 06:40:57,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-06-22 06:40:57,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 279 transitions. [2020-06-22 06:40:57,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 06:40:57,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 06:40:57,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 279 transitions. [2020-06-22 06:40:57,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,761 INFO L706 BuchiCegarLoop]: Abstraction has 207 states and 279 transitions. [2020-06-22 06:40:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 279 transitions. [2020-06-22 06:40:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2020-06-22 06:40:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-06-22 06:40:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2020-06-22 06:40:57,767 INFO L729 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. [2020-06-22 06:40:57,767 INFO L609 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. [2020-06-22 06:40:57,767 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 06:40:57,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 202 transitions. [2020-06-22 06:40:57,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2020-06-22 06:40:57,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-06-22 06:40:57,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 06:40:57,770 INFO L794 eck$LassoCheckResult]: Stem: 2162#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2163#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2256#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2255#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2254#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2161#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2176#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2174#L25 [2020-06-22 06:40:57,770 INFO L796 eck$LassoCheckResult]: Loop: 2174#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2175#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2289#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2287#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2177#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2179#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2292#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2293#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2296#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2155#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2156#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2174#L25 [2020-06-22 06:40:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 1 times [2020-06-22 06:40:57,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:57,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1027598862, now seen corresponding path program 2 times [2020-06-22 06:40:57,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:40:57,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:40:57,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 06:40:57,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 06:40:57,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:40:57,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:40:57,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:40:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 06:40:57,855 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 06:40:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 06:40:57,856 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. cyclomatic complexity: 55 Second operand 5 states. [2020-06-22 06:40:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:57,896 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. [2020-06-22 06:40:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 06:40:57,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 246 transitions. [2020-06-22 06:40:57,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 136 [2020-06-22 06:40:57,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 246 transitions. [2020-06-22 06:40:57,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-06-22 06:40:57,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2020-06-22 06:40:57,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 246 transitions. [2020-06-22 06:40:57,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,902 INFO L706 BuchiCegarLoop]: Abstraction has 192 states and 246 transitions. [2020-06-22 06:40:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 246 transitions. [2020-06-22 06:40:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2020-06-22 06:40:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-06-22 06:40:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2020-06-22 06:40:57,906 INFO L729 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. [2020-06-22 06:40:57,906 INFO L609 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. [2020-06-22 06:40:57,906 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 06:40:57,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 212 transitions. [2020-06-22 06:40:57,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 133 [2020-06-22 06:40:57,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-06-22 06:40:57,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 06:40:57,910 INFO L794 eck$LassoCheckResult]: Stem: 2534#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2535#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2581#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2580#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2579#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2561#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2557#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2553#L25 [2020-06-22 06:40:57,910 INFO L796 eck$LassoCheckResult]: Loop: 2553#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2554#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2639#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2638#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2582#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2583#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2642#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2641#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2640#L25 [79] L25-->L34: Formula: (and (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1)) (>= v_ULTIMATE.start_main_~j~0_9 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2548#L34 [63] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1))) (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2549#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2558#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2553#L25 [2020-06-22 06:40:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 2 times [2020-06-22 06:40:57,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:57,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:57,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,919 INFO L82 PathProgramCache]: Analyzing trace with hash -672837903, now seen corresponding path program 3 times [2020-06-22 06:40:57,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:57,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 06:40:57,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 06:40:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 06:40:57,956 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-06-22 06:40:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:57,987 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2020-06-22 06:40:57,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 06:40:57,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 172 transitions. [2020-06-22 06:40:57,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2020-06-22 06:40:57,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 172 transitions. [2020-06-22 06:40:57,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-06-22 06:40:57,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-06-22 06:40:57,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 172 transitions. [2020-06-22 06:40:57,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:57,992 INFO L706 BuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2020-06-22 06:40:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 172 transitions. [2020-06-22 06:40:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2020-06-22 06:40:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-06-22 06:40:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2020-06-22 06:40:57,995 INFO L729 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. [2020-06-22 06:40:57,995 INFO L609 BuchiCegarLoop]: Abstraction has 127 states and 167 transitions. [2020-06-22 06:40:57,995 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 06:40:57,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 167 transitions. [2020-06-22 06:40:57,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-06-22 06:40:57,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:57,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:57,997 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-06-22 06:40:57,997 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1] [2020-06-22 06:40:57,998 INFO L794 eck$LassoCheckResult]: Stem: 2843#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2844#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2837#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2846#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2835#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2836#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2944#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2942#L16 [2020-06-22 06:40:57,998 INFO L796 eck$LassoCheckResult]: Loop: 2942#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2943#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2958#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2957#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2879#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2947#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2948#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2955#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2945#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2946#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2942#L16 [2020-06-22 06:40:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2014361716, now seen corresponding path program 1 times [2020-06-22 06:40:57,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:57,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1352612346, now seen corresponding path program 1 times [2020-06-22 06:40:58,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1638900783, now seen corresponding path program 1 times [2020-06-22 06:40:58,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:58,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 06:40:58,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:58,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 06:40:58,091 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:58,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:58,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:58,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:58,092 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:58,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:58,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:58,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:58,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2020-06-22 06:40:58,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:58,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:58,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,152 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:58,153 INFO L412 LassoAnalysis]: Checking for nontermination... 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-06-22 06:40:58,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:58,156 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:58,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:58,183 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-06-22 06:40:58,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:58,188 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-06-22 06:40:58,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:40:58,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:58,258 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:40:58,260 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:58,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:58,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:58,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:58,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:40:58,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:40:58,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:58,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:58,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2020-06-22 06:40:58,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:58,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:58,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:58,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:58,328 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:40:58,329 INFO L122 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-06-22 06:40:58,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:40:58,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:40:58,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:40:58,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:40:58,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:40:58,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:40:58,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:40:58,334 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:40:58,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:40:58,336 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:40:58,336 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:40:58,336 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:40:58,336 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:40:58,337 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 06:40:58,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:40:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:40:58,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:58,594 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 06:40:58,595 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-06-22 06:40:58,595 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 167 transitions. cyclomatic complexity: 43 Second operand 5 states. [2020-06-22 06:40:58,832 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 167 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 764 states and 979 transitions. Complement of second has 42 states. [2020-06-22 06:40:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 6 non-accepting loop states 3 accepting loop states [2020-06-22 06:40:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:40:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2020-06-22 06:40:58,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 7 letters. Loop has 10 letters. [2020-06-22 06:40:58,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:58,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 17 letters. Loop has 10 letters. [2020-06-22 06:40:58,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:58,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 43 transitions. Stem has 7 letters. Loop has 20 letters. [2020-06-22 06:40:58,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:40:58,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 764 states and 979 transitions. [2020-06-22 06:40:58,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 146 [2020-06-22 06:40:58,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 764 states to 265 states and 328 transitions. [2020-06-22 06:40:58,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 06:40:58,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-06-22 06:40:58,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 328 transitions. [2020-06-22 06:40:58,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:58,846 INFO L706 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. [2020-06-22 06:40:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 328 transitions. [2020-06-22 06:40:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 153. [2020-06-22 06:40:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-06-22 06:40:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. [2020-06-22 06:40:58,851 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. [2020-06-22 06:40:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 06:40:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 06:40:58,851 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. Second operand 4 states. [2020-06-22 06:40:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:58,877 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2020-06-22 06:40:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 06:40:58,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 228 transitions. [2020-06-22 06:40:58,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2020-06-22 06:40:58,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 175 states and 228 transitions. [2020-06-22 06:40:58,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-06-22 06:40:58,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-22 06:40:58,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 228 transitions. [2020-06-22 06:40:58,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:58,883 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 228 transitions. [2020-06-22 06:40:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 228 transitions. [2020-06-22 06:40:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 153. [2020-06-22 06:40:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-06-22 06:40:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. [2020-06-22 06:40:58,887 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. [2020-06-22 06:40:58,887 INFO L609 BuchiCegarLoop]: Abstraction has 153 states and 206 transitions. [2020-06-22 06:40:58,887 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 06:40:58,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 206 transitions. [2020-06-22 06:40:58,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2020-06-22 06:40:58,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:58,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:58,889 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 06:40:58,889 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1] [2020-06-22 06:40:58,889 INFO L794 eck$LassoCheckResult]: Stem: 4324#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4325#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4360#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4421#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4422#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4450#L12 [2020-06-22 06:40:58,890 INFO L796 eck$LassoCheckResult]: Loop: 4450#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4405#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4406#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4400#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4427#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4425#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4424#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4410#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4423#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4420#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4360#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4421#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4422#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4450#L12 [2020-06-22 06:40:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 78350726, now seen corresponding path program 2 times [2020-06-22 06:40:58,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:58,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:58,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 106925335, now seen corresponding path program 1 times [2020-06-22 06:40:58,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:58,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:58,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 06:40:58,918 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 06:40:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 06:40:58,919 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. cyclomatic complexity: 55 Second operand 5 states. [2020-06-22 06:40:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:58,946 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2020-06-22 06:40:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 06:40:58,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 215 transitions. [2020-06-22 06:40:58,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-06-22 06:40:58,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 159 states and 209 transitions. [2020-06-22 06:40:58,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 06:40:58,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2020-06-22 06:40:58,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 209 transitions. [2020-06-22 06:40:58,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:58,953 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 209 transitions. [2020-06-22 06:40:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 209 transitions. [2020-06-22 06:40:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2020-06-22 06:40:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-06-22 06:40:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-06-22 06:40:58,957 INFO L729 BuchiCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-06-22 06:40:58,957 INFO L609 BuchiCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-06-22 06:40:58,957 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 06:40:58,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 190 transitions. [2020-06-22 06:40:58,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 06:40:58,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:58,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:58,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-06-22 06:40:58,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-06-22 06:40:58,959 INFO L794 eck$LassoCheckResult]: Stem: 4658#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4659#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4686#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4729#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4727#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4728#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4770#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4762#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4763#L34-2 [2020-06-22 06:40:58,960 INFO L796 eck$LassoCheckResult]: Loop: 4763#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4788#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4787#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4786#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4785#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4673#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4674#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4763#L34-2 [2020-06-22 06:40:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296300, now seen corresponding path program 2 times [2020-06-22 06:40:58,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:58,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:40:58,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:40:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 06:40:59,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 06:40:59,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:40:59,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:59,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:40:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-06-22 06:40:59,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 06:40:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash 802769598, now seen corresponding path program 2 times [2020-06-22 06:40:59,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,086 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:59,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:59,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:59,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:59,087 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:59,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:59,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:59,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-06-22 06:40:59,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:59,087 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:59,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:59,138 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,171 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:40:59,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,211 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Honda state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=3}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,263 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,263 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 06:40:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 06:40:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 06:40:59,266 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. cyclomatic complexity: 56 Second operand 7 states. [2020-06-22 06:40:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:59,312 INFO L93 Difference]: Finished difference Result 178 states and 232 transitions. [2020-06-22 06:40:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 06:40:59,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 232 transitions. [2020-06-22 06:40:59,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-06-22 06:40:59,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 178 states and 232 transitions. [2020-06-22 06:40:59,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-06-22 06:40:59,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-06-22 06:40:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 232 transitions. [2020-06-22 06:40:59,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:59,317 INFO L706 BuchiCegarLoop]: Abstraction has 178 states and 232 transitions. [2020-06-22 06:40:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 232 transitions. [2020-06-22 06:40:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. [2020-06-22 06:40:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-06-22 06:40:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2020-06-22 06:40:59,322 INFO L729 BuchiCegarLoop]: Abstraction has 146 states and 200 transitions. [2020-06-22 06:40:59,322 INFO L609 BuchiCegarLoop]: Abstraction has 146 states and 200 transitions. [2020-06-22 06:40:59,322 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 06:40:59,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 200 transitions. [2020-06-22 06:40:59,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 06:40:59,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:59,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:59,324 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-06-22 06:40:59,324 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1] [2020-06-22 06:40:59,324 INFO L794 eck$LassoCheckResult]: Stem: 5009#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5010#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5033#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5139#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5138#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5137#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5136#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5121#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5093#L34-2 [2020-06-22 06:40:59,324 INFO L796 eck$LassoCheckResult]: Loop: 5093#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5011#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5012#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5135#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5143#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5142#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5141#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5081#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5082#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5122#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5093#L34-2 [2020-06-22 06:40:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296319, now seen corresponding path program 1 times [2020-06-22 06:40:59,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash 937684527, now seen corresponding path program 2 times [2020-06-22 06:40:59,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:40:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 06:40:59,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:40:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 06:40:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 06:40:59,369 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. cyclomatic complexity: 60 Second operand 7 states. [2020-06-22 06:40:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:59,432 INFO L93 Difference]: Finished difference Result 252 states and 305 transitions. [2020-06-22 06:40:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 06:40:59,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 305 transitions. [2020-06-22 06:40:59,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-06-22 06:40:59,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 149 states and 173 transitions. [2020-06-22 06:40:59,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-06-22 06:40:59,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2020-06-22 06:40:59,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 173 transitions. [2020-06-22 06:40:59,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:59,438 INFO L706 BuchiCegarLoop]: Abstraction has 149 states and 173 transitions. [2020-06-22 06:40:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 173 transitions. [2020-06-22 06:40:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2020-06-22 06:40:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-06-22 06:40:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2020-06-22 06:40:59,441 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-06-22 06:40:59,441 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-06-22 06:40:59,441 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 06:40:59,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 109 transitions. [2020-06-22 06:40:59,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:40:59,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:59,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:59,442 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-06-22 06:40:59,442 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-06-22 06:40:59,443 INFO L794 eck$LassoCheckResult]: Stem: 5417#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5418#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5449#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5479#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5478#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5474#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5475#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5471#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5407#L34-2 [2020-06-22 06:40:59,443 INFO L796 eck$LassoCheckResult]: Loop: 5407#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5408#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5419#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5466#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5410#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5464#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5465#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5407#L34-2 [2020-06-22 06:40:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296319, now seen corresponding path program 2 times [2020-06-22 06:40:59,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,451 INFO L82 PathProgramCache]: Analyzing trace with hash 802769598, now seen corresponding path program 3 times [2020-06-22 06:40:59,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1880440512, now seen corresponding path program 1 times [2020-06-22 06:40:59,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:59,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:40:59,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 06:40:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:40:59,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:40:59,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:40:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:40:59,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:40:59,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 06:40:59,584 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:59,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:59,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:59,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:59,585 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:59,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:59,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:59,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-06-22 06:40:59,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:59,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:59,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:59,647 INFO L412 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-06-22 06:40:59,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,652 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-06-22 06:40:59,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:40:59,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Honda state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}] Lambdas: [1, 0, 1] Nus: [0, 1] 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-06-22 06:40:59,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,718 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,746 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,777 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_8=0} Honda state: {v_rep~unnamed0~0~false_8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 06:40:59,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 06:40:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 06:40:59,779 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. cyclomatic complexity: 23 Second operand 5 states. [2020-06-22 06:40:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:40:59,808 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2020-06-22 06:40:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 06:40:59,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 118 transitions. [2020-06-22 06:40:59,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:40:59,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 82 states and 96 transitions. [2020-06-22 06:40:59,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-06-22 06:40:59,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-06-22 06:40:59,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 96 transitions. [2020-06-22 06:40:59,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:40:59,812 INFO L706 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2020-06-22 06:40:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 96 transitions. [2020-06-22 06:40:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2020-06-22 06:40:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-06-22 06:40:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2020-06-22 06:40:59,814 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-06-22 06:40:59,814 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2020-06-22 06:40:59,814 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2020-06-22 06:40:59,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2020-06-22 06:40:59,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:40:59,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:40:59,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:40:59,816 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1] [2020-06-22 06:40:59,816 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-06-22 06:40:59,816 INFO L794 eck$LassoCheckResult]: Stem: 5657#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5658#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5689#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5712#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5654#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5656#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5661#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5666#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5710#L12 [2020-06-22 06:40:59,816 INFO L796 eck$LassoCheckResult]: Loop: 5710#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5709#L14 [66] L14-->L16: Formula: (and (< v_ULTIMATE.start_main_~j~0_16 5) (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5647#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5648#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5659#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5660#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5711#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5710#L12 [2020-06-22 06:40:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296516, now seen corresponding path program 3 times [2020-06-22 06:40:59,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:40:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1101395972, now seen corresponding path program 4 times [2020-06-22 06:40:59,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:40:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1915319201, now seen corresponding path program 3 times [2020-06-22 06:40:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:40:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:40:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:40:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:40:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:40:59,889 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:40:59,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:40:59,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:40:59,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:40:59,890 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:40:59,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:40:59,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:40:59,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-06-22 06:40:59,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:40:59,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:40:59,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:40:59,944 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:40:59,944 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:40:59,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:40:59,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:40:59,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:40:59,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,008 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:41:00,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Honda state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=3}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2020-06-22 06:41:00,106 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:41:00,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:41:00,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:41:00,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:41:00,107 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:41:00,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:41:00,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:41:00,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Lasso [2020-06-22 06:41:00,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:41:00,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:41:00,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:41:00,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:41:00,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:41:00,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:41:00,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:41:00,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:41:00,177 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,183 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,209 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:41:00,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0} Honda state: {ULTIMATE.start_main_~i~0=8, ULTIMATE.start_main_~j~0=4} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~j~0=0}, {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0}, {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,279 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:41:00,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-06-22 06:41:00,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:41:00,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:41:00,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:41:00,360 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 06:41:00,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,371 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,371 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,371 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:41:00 BasicIcfg [2020-06-22 06:41:00,385 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:41:00,386 INFO L168 Benchmark]: Toolchain (without parser) took 6495.48 ms. Allocated memory was 649.6 MB in the beginning and 763.9 MB in the end (delta: 114.3 MB). Free memory was 558.8 MB in the beginning and 423.8 MB in the end (delta: 135.1 MB). Peak memory consumption was 249.4 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,387 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:41:00,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.23 ms. Allocated memory was 649.6 MB in the beginning and 669.5 MB in the end (delta: 19.9 MB). Free memory was 558.8 MB in the beginning and 635.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.11 ms. Allocated memory is still 669.5 MB. Free memory was 635.2 MB in the beginning and 632.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,389 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 ms. Allocated memory is still 669.5 MB. Free memory was 632.4 MB in the beginning and 631.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,389 INFO L168 Benchmark]: RCFGBuilder took 219.47 ms. Allocated memory is still 669.5 MB. Free memory was 630.2 MB in the beginning and 616.5 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,390 INFO L168 Benchmark]: BlockEncodingV2 took 83.20 ms. Allocated memory is still 669.5 MB. Free memory was 616.5 MB in the beginning and 610.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,390 INFO L168 Benchmark]: TraceAbstraction took 158.26 ms. Allocated memory is still 669.5 MB. Free memory was 610.0 MB in the beginning and 601.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,391 INFO L168 Benchmark]: BuchiAutomizer took 5689.53 ms. Allocated memory was 669.5 MB in the beginning and 763.9 MB in the end (delta: 94.4 MB). Free memory was 601.4 MB in the beginning and 423.8 MB in the end (delta: 177.6 MB). Peak memory consumption was 272.0 MB. Max. memory is 50.3 GB. [2020-06-22 06:41:00,394 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 19 edges - StatisticsResult: Encoded RCFG 8 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 285.23 ms. Allocated memory was 649.6 MB in the beginning and 669.5 MB in the end (delta: 19.9 MB). Free memory was 558.8 MB in the beginning and 635.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.11 ms. Allocated memory is still 669.5 MB. Free memory was 635.2 MB in the beginning and 632.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.55 ms. Allocated memory is still 669.5 MB. Free memory was 632.4 MB in the beginning and 631.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 219.47 ms. Allocated memory is still 669.5 MB. Free memory was 630.2 MB in the beginning and 616.5 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 83.20 ms. Allocated memory is still 669.5 MB. Free memory was 616.5 MB in the beginning and 610.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 158.26 ms. Allocated memory is still 669.5 MB. Free memory was 610.0 MB in the beginning and 601.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5689.53 ms. Allocated memory was 669.5 MB in the beginning and 763.9 MB in the end (delta: 94.4 MB). Free memory was 601.4 MB in the beginning and 423.8 MB in the end (delta: 177.6 MB). Peak memory consumption was 272.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false * 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, 8 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 11 locations. 14 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 67 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 17 iterations. TraceHistogramMax:5. Analysis of lassos took 3.2s. Construction of modules took 0.6s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 17. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 446 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 171 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 15/17 HoareTripleCheckerStatistics: 84 SDtfs, 147 SDslu, 46 SDs, 0 SdLazy, 678 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT2 conc1 concLT1 SILN1 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax155 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf93 smp96 dnf100 smp100 tf106 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 12]: Nontermination argument in form of an infinite program execution. [2020-06-22 06:41:00,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,404 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,404 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,404 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-06-22 06:41:00,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-06-22 06:41:00,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false Nontermination argument in form of an infinite execution {|ULTIMATE.start_main_#t~nondet0|=0, ~unnamed0~0~true=1, ULTIMATE.start_main_~i~0=0, ~unnamed0~0~false=0, ULTIMATE.start_main_~j~0=0, |ULTIMATE.start_main_#res|=0} {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3146a234=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=8, j=4} {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3146a234=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=11, j=4} {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3146a234=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=14, j=4} {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3146a234=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=17, j=4} {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3146a234=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=20, j=4} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 1GEVs Lambdas: [1, 0, 0] Mus: [0, 0] - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] i = __VERIFIER_nondet_int() [L9] j = i [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 Loop: [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND TRUE j < 5 [L15] j = j+1 [L16] COND TRUE i-j>2 [L17] i = i+1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 06:40:50.627 ----------------------------------------------- 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 -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 06:41:00.640 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check