YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 00:38:54,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 00:38:54,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 00:38:54,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 00:38:54,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 00:38:54,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 00:38:54,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 00:38:54,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 00:38:54,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 00:38:54,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 00:38:54,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 00:38:54,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 00:38:54,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 00:38:54,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 00:38:54,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 00:38:54,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 00:38:54,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 00:38:54,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 00:38:54,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 00:38:54,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 00:38:54,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 00:38:54,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 00:38:54,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 00:38:54,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 00:38:54,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 00:38:54,521 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 00:38:54,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 00:38:54,522 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 00:38:54,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 00:38:54,523 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 00:38:54,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 00:38:54,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 00:38:54,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 00:38:54,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 00:38:54,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 00:38:54,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 00:38:54,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 00:38:54,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 00:38:54,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 00:38:54,528 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 00:38:54,543 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 00:38:54,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 00:38:54,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 00:38:54,544 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 00:38:54,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 00:38:54,545 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:38:54,545 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 00:38:54,545 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 00:38:54,545 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 00:38:54,545 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:38:54,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 00:38:54,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 00:38:54,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 00:38:54,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 00:38:54,547 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 00:38:54,547 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 00:38:54,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 00:38:54,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 00:38:54,548 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 00:38:54,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 00:38:54,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 00:38:54,548 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 00:38:54,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 00:38:54,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 00:38:54,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 00:38:54,586 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 00:38:54,590 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 00:38:54,591 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 00:38:54,592 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 00:38:54,592 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 00:38:54,682 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/821f6e1166de4db286bd935b9cf18c22/FLAG9d0fed103 [2020-06-22 00:38:55,026 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 00:38:55,027 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 00:38:55,033 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/821f6e1166de4db286bd935b9cf18c22/FLAG9d0fed103 [2020-06-22 00:38:55,440 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/821f6e1166de4db286bd935b9cf18c22 [2020-06-22 00:38:55,452 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 00:38:55,453 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 00:38:55,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 00:38:55,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 00:38:55,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 00:38:55,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356dbeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55, skipping insertion in model container [2020-06-22 00:38:55,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 00:38:55,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 00:38:55,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:38:55,652 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 00:38:55,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:38:55,751 INFO L195 MainTranslator]: Completed translation [2020-06-22 00:38:55,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55 WrapperNode [2020-06-22 00:38:55,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 00:38:55,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 00:38:55,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 00:38:55,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 00:38:55,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 00:38:55,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 00:38:55,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 00:38:55,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 00:38:55,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... [2020-06-22 00:38:55,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 00:38:55,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 00:38:55,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 00:38:55,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 00:38:55,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 00:38:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 00:38:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 00:38:56,003 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 00:38:56,003 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 00:38:56,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:38:56 BoogieIcfgContainer [2020-06-22 00:38:56,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 00:38:56,005 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 00:38:56,006 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 00:38:56,007 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 00:38:56,008 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:38:56" (1/1) ... [2020-06-22 00:38:56,022 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 13 edges [2020-06-22 00:38:56,024 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 00:38:56,025 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 00:38:56,025 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 00:38:56,026 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:38:56,027 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 00:38:56,028 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 00:38:56,028 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 00:38:56,043 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 00:38:56,051 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 00:38:56,055 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 00:38:56,057 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:38:56,070 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 00:38:56,072 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 00:38:56,073 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 00:38:56,073 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:38:56,074 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 00:38:56,074 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 00:38:56,074 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 8 edges [2020-06-22 00:38:56,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:38:56 BasicIcfg [2020-06-22 00:38:56,075 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 00:38:56,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 00:38:56,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 00:38:56,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 00:38:56,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 12:38:55" (1/4) ... [2020-06-22 00:38:56,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a5a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (2/4) ... [2020-06-22 00:38:56,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a5a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:38:56" (3/4) ... [2020-06-22 00:38:56,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a5a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:38:56" (4/4) ... [2020-06-22 00:38:56,084 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:38:56,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 00:38:56,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 00:38:56,120 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 00:38:56,148 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:38:56,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 00:38:56,149 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 00:38:56,149 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:38:56,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:38:56,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:38:56,150 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 00:38:56,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:38:56,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 00:38:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 00:38:56,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 00:38:56,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 00:38:56,225 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 21) no Hoare annotation was computed. [2020-06-22 00:38:56,225 INFO L451 ceAbstractionStarter]: At program point L17-2(lines 17 29) the Hoare annotation is: true [2020-06-22 00:38:56,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 00:38:56,226 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-06-22 00:38:56,226 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2020-06-22 00:38:56,226 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-06-22 00:38:56,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:38:56 BasicIcfg [2020-06-22 00:38:56,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 00:38:56,235 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 00:38:56,235 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 00:38:56,238 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 00:38:56,239 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:38:56,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 12:38:55" (1/5) ... [2020-06-22 00:38:56,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5822cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,240 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:38:56,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:38:55" (2/5) ... [2020-06-22 00:38:56,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5822cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:38:56,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:38:56" (3/5) ... [2020-06-22 00:38:56,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5822cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:38:56,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:38:56" (4/5) ... [2020-06-22 00:38:56,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5822cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:38:56, skipping insertion in model container [2020-06-22 00:38:56,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:38:56,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:38:56" (5/5) ... [2020-06-22 00:38:56,244 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:38:56,271 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:38:56,271 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 00:38:56,271 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 00:38:56,272 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:38:56,272 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:38:56,272 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:38:56,272 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 00:38:56,272 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:38:56,272 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 00:38:56,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 00:38:56,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 00:38:56,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:38:56,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:38:56,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:38:56,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 00:38:56,300 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 00:38:56,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 00:38:56,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 00:38:56,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:38:56,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:38:56,302 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:38:56,302 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 00:38:56,307 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_1, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~nondetPos~0] 3#L17-2true [2020-06-22 00:38:56,308 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 8#L19true [40] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_5 (- v_ULTIMATE.start_main_~nondetNat~0_6)) (< v_ULTIMATE.start_main_~nondetNat~0_6 0)) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_6} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetNat~0] 6#L19-2true [37] L19-2-->L24: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 (* (- 1) v_ULTIMATE.start_main_~nondetNat~0_8)))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetPos~0] 7#L24true [38] L24-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_5 (- v_ULTIMATE.start_main_~nondetPos~0_6)) (< v_ULTIMATE.start_main_~nondetPos~0_6 0)) InVars {ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_6} OutVars{ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetPos~0] 5#L24-2true [36] L24-2-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_8 (+ v_ULTIMATE.start_main_~nondetPos~0_9 1)) (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~nondetPos~0_8))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nondetPos~0] 3#L17-2true [2020-06-22 00:38:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:38:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times [2020-06-22 00:38:56,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:38:56,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:38:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:38:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:38:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash 61257276, now seen corresponding path program 1 times [2020-06-22 00:38:56,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:38:56,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:38:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:38:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:38:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1922152091, now seen corresponding path program 1 times [2020-06-22 00:38:56,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:38:56,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:38:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:38:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:38:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:38:56,528 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:38:56,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:38:56,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:38:56,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:38:56,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:38:56,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:38:56,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:38:56,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:38:56,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:38:56,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:38:56,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:38:56,550 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 00:38:56,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:38:56,563 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 00:38:56,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:38:56,720 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 00:38:56,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:38:56,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:38:56,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:38:56,760 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/sandbox/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 00:38:56,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:38:56,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:38:56,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:38:56,794 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/sandbox/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 00:38:56,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:38:56,800 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 00:38:56,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:38:56,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:02,500 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:39:02,504 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:02,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:02,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:02,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:02,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:39:02,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:39:02,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:02,505 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:02,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:39:02,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:02,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:02,508 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 00:39:02,511 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 00:39:02,515 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 00:39:02,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:02,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:39:02,643 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 00:39:02,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:02,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:02,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:02,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:02,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:39:02,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:39:02,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:39:02,659 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 00:39:02,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:02,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:02,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:02,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:02,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:39:02,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:39:02,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:39:02,671 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 00:39:02,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:02,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:39:02,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:02,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:02,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:02,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:39:02,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:39:02,692 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:39:02,710 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 00:39:02,710 INFO L444 ModelExtractionUtils]: 4 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:39:02,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:39:02,713 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:39:02,713 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:39:02,713 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 00:39:02,715 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:39:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:02,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:39:02,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:02,766 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 00:39:02,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:02,841 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 00:39:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:02,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 00:39:02,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:03,035 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 00:39:03,040 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-22 00:39:03,042 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 6 states. [2020-06-22 00:39:03,683 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 6 states. Result 79 states and 99 transitions. Complement of second has 46 states. [2020-06-22 00:39:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 21 non-accepting loop states 3 accepting loop states [2020-06-22 00:39:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 00:39:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 55 transitions. [2020-06-22 00:39:03,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 55 transitions. Stem has 1 letters. Loop has 5 letters. [2020-06-22 00:39:03,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:03,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 55 transitions. Stem has 6 letters. Loop has 5 letters. [2020-06-22 00:39:03,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:03,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 55 transitions. Stem has 1 letters. Loop has 10 letters. [2020-06-22 00:39:03,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:03,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 99 transitions. [2020-06-22 00:39:03,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2020-06-22 00:39:03,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 45 states and 57 transitions. [2020-06-22 00:39:03,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-06-22 00:39:03,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-06-22 00:39:03,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2020-06-22 00:39:03,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:39:03,728 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-06-22 00:39:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2020-06-22 00:39:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 14. [2020-06-22 00:39:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 00:39:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 00:39:03,759 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 00:39:03,759 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 00:39:03,759 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 00:39:03,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-22 00:39:03,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 00:39:03,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:39:03,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:39:03,761 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:39:03,761 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 00:39:03,761 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_1, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~nondetPos~0] 241#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 248#L19 [46] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~nondetNat~0_7 0) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} AuxVars[] AssignedVars[] 244#L19-2 [2020-06-22 00:39:03,762 INFO L796 eck$LassoCheckResult]: Loop: 244#L19-2 [37] L19-2-->L24: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 (* (- 1) v_ULTIMATE.start_main_~nondetNat~0_8)))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetPos~0] 245#L24 [38] L24-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_5 (- v_ULTIMATE.start_main_~nondetPos~0_6)) (< v_ULTIMATE.start_main_~nondetPos~0_6 0)) InVars {ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_6} OutVars{ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetPos~0] 242#L24-2 [36] L24-2-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_8 (+ v_ULTIMATE.start_main_~nondetPos~0_9 1)) (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~nondetPos~0_8))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nondetPos~0] 236#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 237#L19 [40] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_5 (- v_ULTIMATE.start_main_~nondetNat~0_6)) (< v_ULTIMATE.start_main_~nondetNat~0_6 0)) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_6} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetNat~0] 244#L19-2 [2020-06-22 00:39:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 64526, now seen corresponding path program 1 times [2020-06-22 00:39:03,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 63967176, now seen corresponding path program 2 times [2020-06-22 00:39:03,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:03,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash 523998171, now seen corresponding path program 1 times [2020-06-22 00:39:03,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:39:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:03,852 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:03,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:03,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:03,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:03,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:39:03,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:03,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:03,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:03,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 00:39:03,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:03,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:03,855 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 00:39:03,858 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 00:39:03,860 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 00:39:03,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:03,931 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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 00:39:03,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:39:03,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:03,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:39:03,961 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/sandbox/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 00:39:03,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:39:03,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:03,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:39:03,992 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/sandbox/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 00:39:03,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:39:03,997 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 00:39:04,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:39:04,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:16,066 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 00:39:16,070 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:16,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:16,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:16,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:16,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:39:16,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:39:16,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:16,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:16,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 00:39:16,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:16,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:16,074 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 00:39:16,076 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 00:39:16,079 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 00:39:16,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:16,152 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:39:16,152 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 00:39:16,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:16,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:16,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:16,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:16,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:39:16,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:39:16,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:39:16,159 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 00:39:16,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:16,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:16,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:16,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:16,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:39:16,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:39:16,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:39:16,167 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 00:39:16,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:16,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:39:16,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:16,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:16,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:16,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:39:16,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:39:16,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:39:16,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:39:16,186 INFO L444 ModelExtractionUtils]: 3 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:39:16,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:39:16,186 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:39:16,186 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:39:16,187 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~nondetNat~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 00:39:16,187 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:39:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:16,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:39:16,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:16,218 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 00:39:16,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:16,261 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 00:39:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,284 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,290 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:16,290 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 00:39:16,290 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 00:39:16,291 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-06-22 00:39:16,439 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 27 states and 36 transitions. Complement of second has 12 states. [2020-06-22 00:39:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 00:39:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 00:39:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2020-06-22 00:39:16,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 3 letters. Loop has 5 letters. [2020-06-22 00:39:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 00:39:16,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:16,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 3 letters. Loop has 10 letters. [2020-06-22 00:39:16,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:16,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-06-22 00:39:16,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 00:39:16,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 32 transitions. [2020-06-22 00:39:16,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 00:39:16,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 00:39:16,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2020-06-22 00:39:16,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:39:16,447 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-22 00:39:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2020-06-22 00:39:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-06-22 00:39:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 00:39:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-06-22 00:39:16,449 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 00:39:16,449 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 00:39:16,450 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 00:39:16,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-06-22 00:39:16,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 00:39:16,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:39:16,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:39:16,451 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:39:16,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 00:39:16,451 INFO L794 eck$LassoCheckResult]: Stem: 349#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_1, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~nondetPos~0] 350#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 360#L19 [46] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~nondetNat~0_7 0) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} AuxVars[] AssignedVars[] 361#L19-2 [2020-06-22 00:39:16,452 INFO L796 eck$LassoCheckResult]: Loop: 361#L19-2 [37] L19-2-->L24: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 (* (- 1) v_ULTIMATE.start_main_~nondetNat~0_8)))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetPos~0] 357#L24 [47] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~nondetPos~0_7 0) InVars {ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_7} OutVars{ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_7} AuxVars[] AssignedVars[] 351#L24-2 [36] L24-2-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_8 (+ v_ULTIMATE.start_main_~nondetPos~0_9 1)) (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~nondetPos~0_8))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nondetPos~0] 345#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 346#L19 [46] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~nondetNat~0_7 0) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_7} AuxVars[] AssignedVars[] 361#L19-2 [2020-06-22 00:39:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash 64526, now seen corresponding path program 2 times [2020-06-22 00:39:16,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:16,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash 64235301, now seen corresponding path program 1 times [2020-06-22 00:39:16,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:16,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:16,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:39:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash 524266296, now seen corresponding path program 1 times [2020-06-22 00:39:16,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:16,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:16,516 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:16,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:16,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:16,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:16,516 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:39:16,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:16,517 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:16,517 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:16,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 00:39:16,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:16,517 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:16,518 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 00:39:16,536 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 00:39:16,538 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 00:39:16,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:16,597 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:16,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:39:16,602 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:16,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:39:16,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:28,676 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 00:39:28,681 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:28,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:28,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:28,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:28,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:39:28,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:39:28,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:28,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:28,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 00:39:28,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:28,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:28,684 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 00:39:28,699 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 00:39:28,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:39:28,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:28,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:39:28,760 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 00:39:28,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:28,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:39:28,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:28,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:28,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:28,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:39:28,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:39:28,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:39:28,775 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 00:39:28,776 INFO L444 ModelExtractionUtils]: 3 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:39:28,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:39:28,776 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:39:28,776 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:39:28,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~nondetNat~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 00:39:28,777 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:39:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:28,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:39:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:28,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 00:39:28,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:28,842 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 00:39:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:28,862 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:28,867 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:28,867 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 00:39:28,867 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 00:39:28,867 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 00:39:28,987 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 37 states and 57 transitions. Complement of second has 12 states. [2020-06-22 00:39:28,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 00:39:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 00:39:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2020-06-22 00:39:28,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 3 letters. Loop has 5 letters. [2020-06-22 00:39:28,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:28,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 00:39:28,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:28,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 3 letters. Loop has 10 letters. [2020-06-22 00:39:28,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:28,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 57 transitions. [2020-06-22 00:39:28,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 00:39:28,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 13 states and 15 transitions. [2020-06-22 00:39:28,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 00:39:28,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 00:39:28,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-06-22 00:39:28,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 00:39:28,994 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-06-22 00:39:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-06-22 00:39:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-06-22 00:39:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 00:39:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-06-22 00:39:28,996 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-06-22 00:39:28,996 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-06-22 00:39:28,996 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 00:39:28,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-06-22 00:39:28,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 00:39:28,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:39:28,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:39:28,997 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 00:39:28,997 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 00:39:28,998 INFO L794 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_1, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetNat~0, ULTIMATE.start_main_~nondetPos~0] 471#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 472#L19 [40] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_5 (- v_ULTIMATE.start_main_~nondetNat~0_6)) (< v_ULTIMATE.start_main_~nondetNat~0_6 0)) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_6} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetNat~0] 480#L19-2 [37] L19-2-->L24: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 (* (- 1) v_ULTIMATE.start_main_~nondetNat~0_8)))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetPos~0] 481#L24 [47] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~nondetPos~0_7 0) InVars {ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_7} OutVars{ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_7} AuxVars[] AssignedVars[] 475#L24-2 [2020-06-22 00:39:28,998 INFO L796 eck$LassoCheckResult]: Loop: 475#L24-2 [36] L24-2-->L17-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_8 (+ v_ULTIMATE.start_main_~nondetPos~0_9 1)) (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~nondetPos~0_8))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nondetPos~0] 476#L17-2 [34] L17-2-->L19: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_4 |v_ULTIMATE.start_main_#t~nondet2_3|) (<= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetNat~0] 482#L19 [40] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~nondetNat~0_5 (- v_ULTIMATE.start_main_~nondetNat~0_6)) (< v_ULTIMATE.start_main_~nondetNat~0_6 0)) InVars {ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_6} OutVars{ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetNat~0] 478#L19-2 [37] L19-2-->L24: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 (* (- 1) v_ULTIMATE.start_main_~nondetNat~0_8)))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~nondetNat~0=v_ULTIMATE.start_main_~nondetNat~0_8, ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetPos~0] 479#L24 [38] L24-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~nondetPos~0_5 (- v_ULTIMATE.start_main_~nondetPos~0_6)) (< v_ULTIMATE.start_main_~nondetPos~0_6 0)) InVars {ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_6} OutVars{ULTIMATE.start_main_~nondetPos~0=v_ULTIMATE.start_main_~nondetPos~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetPos~0] 475#L24-2 [2020-06-22 00:39:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 62004914, now seen corresponding path program 1 times [2020-06-22 00:39:28,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:29,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:29,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 62928426, now seen corresponding path program 3 times [2020-06-22 00:39:29,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:39:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash -558195175, now seen corresponding path program 1 times [2020-06-22 00:39:29,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:39:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:39:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:39:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:39:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:29,066 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:29,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:29,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:29,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:29,066 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:39:29,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:29,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:29,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:29,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 00:39:29,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:29,067 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:29,068 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 00:39:29,086 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 00:39:29,089 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 00:39:29,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:29,146 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:39:29,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:39:29,149 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 00:39:29,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:39:29,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:39:36,981 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:39:36,985 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:39:36,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:39:36,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:39:36,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:39:36,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:39:36,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:39:36,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:39:36,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:39:36,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 00:39:36,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:39:36,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:39:36,987 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 00:39:37,002 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 00:39:37,005 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 00:39:37,060 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:39:37,060 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:39:37,060 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 00:39:37,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:39:37,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:39:37,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:39:37,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:39:37,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:39:37,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:39:37,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:39:37,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:39:37,075 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 00:39:37,075 INFO L444 ModelExtractionUtils]: 3 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:39:37,076 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:39:37,076 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:39:37,076 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:39:37,076 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nondetPos~0, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~nondetPos~0 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 00:39:37,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:39:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:39:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:37,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:39:37,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:39:37,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 00:39:37,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:39:37,146 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 00:39:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:37,187 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:39:37,192 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 00:39:37,192 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 00:39:37,192 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 6 loop predicates [2020-06-22 00:39:37,192 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-06-22 00:39:37,307 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 24 states and 28 transitions. Complement of second has 18 states. [2020-06-22 00:39:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 00:39:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 00:39:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2020-06-22 00:39:37,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 00:39:37,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:37,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 00:39:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:37,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 00:39:37,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:39:37,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-06-22 00:39:37,328 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:39:37,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-06-22 00:39:37,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 00:39:37,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 00:39:37,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 00:39:37,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 00:39:37,329 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:39:37,329 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:39:37,329 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:39:37,329 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 00:39:37,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 00:39:37,330 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:39:37,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 00:39:37,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:39:37 BasicIcfg [2020-06-22 00:39:37,337 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 00:39:37,337 INFO L168 Benchmark]: Toolchain (without parser) took 41885.16 ms. Allocated memory was 649.6 MB in the beginning and 775.4 MB in the end (delta: 125.8 MB). Free memory was 565.3 MB in the beginning and 737.5 MB in the end (delta: -172.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:39:37,339 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:39:37,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.88 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 565.3 MB in the beginning and 665.9 MB in the end (delta: -100.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 698.4 MB. Free memory was 665.9 MB in the beginning and 663.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,341 INFO L168 Benchmark]: Boogie Preprocessor took 18.96 ms. Allocated memory is still 698.4 MB. Free memory was 663.2 MB in the beginning and 660.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,342 INFO L168 Benchmark]: RCFGBuilder took 199.61 ms. Allocated memory is still 698.4 MB. Free memory was 660.1 MB in the beginning and 647.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,342 INFO L168 Benchmark]: BlockEncodingV2 took 69.53 ms. Allocated memory is still 698.4 MB. Free memory was 647.1 MB in the beginning and 640.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,343 INFO L168 Benchmark]: TraceAbstraction took 158.57 ms. Allocated memory is still 698.4 MB. Free memory was 640.6 MB in the beginning and 631.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 00:39:37,343 INFO L168 Benchmark]: BuchiAutomizer took 41101.90 ms. Allocated memory was 698.4 MB in the beginning and 775.4 MB in the end (delta: 77.1 MB). Free memory was 631.2 MB in the beginning and 737.5 MB in the end (delta: -106.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:39:37,347 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 13 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 297.88 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 565.3 MB in the beginning and 665.9 MB in the end (delta: -100.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 698.4 MB. Free memory was 665.9 MB in the beginning and 663.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.96 ms. Allocated memory is still 698.4 MB. Free memory was 663.2 MB in the beginning and 660.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 199.61 ms. Allocated memory is still 698.4 MB. Free memory was 660.1 MB in the beginning and 647.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 69.53 ms. Allocated memory is still 698.4 MB. Free memory was 647.1 MB in the beginning and 640.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 158.57 ms. Allocated memory is still 698.4 MB. Free memory was 640.6 MB in the beginning and 631.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 41101.90 ms. Allocated memory was 698.4 MB in the beginning and 775.4 MB in the end (delta: 77.1 MB). Free memory was 631.2 MB in the beginning and 737.5 MB in the end (delta: -106.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 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=6occurred 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 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * j + i and consists of 25 locations. One nondeterministic module has affine ranking function i + -1 * nondetNat + -1 * j and consists of 7 locations. One nondeterministic module has affine ranking function i + -1 * nondetNat + -1 * j and consists of 7 locations. One nondeterministic module has affine ranking function -1 * j + -1 * nondetPos + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 39.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 88 SDslu, 80 SDs, 0 SdLazy, 186 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax134 hnf95 lsp73 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq172 hnf92 smp100 dnf100 smp100 tf103 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 37.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 00:38:52.184 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 00:39:37.579 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check