YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:28:42,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:28:42,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:28:42,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:28:42,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:28:42,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:28:42,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:28:42,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:28:42,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:28:42,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:28:42,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:28:42,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:28:42,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:28:42,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:28:42,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:28:42,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:28:42,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:28:42,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:28:42,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:28:42,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:28:42,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:28:42,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:28:42,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:28:42,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:28:42,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:28:42,452 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:28:42,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:28:42,454 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:28:42,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:28:42,454 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:28:42,455 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:28:42,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:28:42,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:28:42,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:28:42,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:28:42,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:28:42,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:28:42,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:28:42,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:28:42,459 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 02:28:42,473 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:28:42,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:28:42,475 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:28:42,475 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:28:42,475 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:28:42,475 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:28:42,475 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:28:42,476 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:28:42,476 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:28:42,476 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:28:42,476 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:28:42,476 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:28:42,476 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:28:42,477 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:28:42,477 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:42,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:28:42,477 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:28:42,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:28:42,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:28:42,478 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:28:42,478 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:28:42,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:28:42,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:28:42,478 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:28:42,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:28:42,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:28:42,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:28:42,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:28:42,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:28:42,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:28:42,517 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:28:42,520 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:28:42,521 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:28:42,522 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:28:42,522 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:28:42,589 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ee4853d628924523a7d83851e5e48577/FLAGf70d030fc [2020-06-22 02:28:42,934 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:28:42,934 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:28:42,942 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ee4853d628924523a7d83851e5e48577/FLAGf70d030fc [2020-06-22 02:28:43,340 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ee4853d628924523a7d83851e5e48577 [2020-06-22 02:28:43,351 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:28:43,352 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:28:43,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:28:43,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:28:43,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:28:43,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5061fe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43, skipping insertion in model container [2020-06-22 02:28:43,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:28:43,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:28:43,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:28:43,557 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:28:43,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:28:43,647 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:28:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43 WrapperNode [2020-06-22 02:28:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:28:43,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:28:43,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:28:43,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:28:43,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:28:43,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:28:43,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:28:43,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:28:43,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:28:43,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:28:43,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:28:43,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:28:43,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:28:43,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:28:43,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:28:43,916 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:28:43,917 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 02:28:43,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:28:43 BoogieIcfgContainer [2020-06-22 02:28:43,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:28:43,919 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:28:43,919 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:28:43,921 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:28:43,922 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:28:43" (1/1) ... [2020-06-22 02:28:43,937 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges [2020-06-22 02:28:43,939 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:28:43,939 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:28:43,940 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:28:43,940 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:28:43,942 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:28:43,943 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:28:43,943 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:28:43,961 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:28:43,981 INFO L200 BlockEncoder]: SBE split 6 edges [2020-06-22 02:28:43,985 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:28:43,987 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:28:43,998 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:28:44,000 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 02:28:44,002 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:28:44,002 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:28:44,002 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:28:44,003 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:28:44,003 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 16 edges [2020-06-22 02:28:44,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:28:44 BasicIcfg [2020-06-22 02:28:44,004 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:28:44,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:28:44,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:28:44,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:28:44,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:28:43" (1/4) ... [2020-06-22 02:28:44,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a489526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (2/4) ... [2020-06-22 02:28:44,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a489526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:28:43" (3/4) ... [2020-06-22 02:28:44,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a489526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:28:44" (4/4) ... [2020-06-22 02:28:44,012 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:28:44,022 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:28:44,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:28:44,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:28:44,079 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:28:44,079 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:28:44,080 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:28:44,080 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:28:44,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:28:44,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:28:44,080 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:28:44,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:28:44,081 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:28:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 02:28:44,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:28:44,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 02:28:44,153 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 27) no Hoare annotation was computed. [2020-06-22 02:28:44,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:28:44,153 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2020-06-22 02:28:44,153 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 16 28) the Hoare annotation is: true [2020-06-22 02:28:44,154 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. [2020-06-22 02:28:44,154 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. [2020-06-22 02:28:44,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:28:44 BasicIcfg [2020-06-22 02:28:44,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:28:44,163 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:28:44,163 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:28:44,166 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:28:44,167 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:28:44,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:28:43" (1/5) ... [2020-06-22 02:28:44,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5516eeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:28:44,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:28:43" (2/5) ... [2020-06-22 02:28:44,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5516eeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:28:44,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:28:43" (3/5) ... [2020-06-22 02:28:44,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5516eeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:28:44,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:28:44" (4/5) ... [2020-06-22 02:28:44,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5516eeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:28:44, skipping insertion in model container [2020-06-22 02:28:44,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:28:44,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:28:44" (5/5) ... [2020-06-22 02:28:44,172 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:28:44,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:28:44,200 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:28:44,200 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:28:44,200 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:28:44,200 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:28:44,200 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:28:44,200 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:28:44,201 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:28:44,201 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:28:44,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 02:28:44,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:28:44,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:44,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:44,229 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:28:44,229 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:44,229 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:28:44,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 02:28:44,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:28:44,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:44,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:44,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:28:44,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:44,236 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 5#L25-2true [2020-06-22 02:28:44,237 INFO L796 eck$LassoCheckResult]: Loop: 5#L25-2true [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 4#L17true [66] L17-->L23: Formula: (> v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~an~0_7) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6#L23true [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L25-2true [2020-06-22 02:28:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,243 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2020-06-22 02:28:44,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:44,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash 89543, now seen corresponding path program 1 times [2020-06-22 02:28:44,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:44,358 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 02:28:44,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:28:44,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:28:44,365 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:28:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:28:44,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:28:44,385 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-06-22 02:28:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:28:44,454 INFO L93 Difference]: Finished difference Result 10 states and 26 transitions. [2020-06-22 02:28:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:28:44,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 26 transitions. [2020-06-22 02:28:44,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:28:44,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 26 transitions. [2020-06-22 02:28:44,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 02:28:44,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 02:28:44,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 26 transitions. [2020-06-22 02:28:44,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:28:44,466 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. [2020-06-22 02:28:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 26 transitions. [2020-06-22 02:28:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 02:28:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:28:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2020-06-22 02:28:44,496 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. [2020-06-22 02:28:44,496 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. [2020-06-22 02:28:44,496 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:28:44,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 26 transitions. [2020-06-22 02:28:44,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:28:44,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:44,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:44,498 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:28:44,498 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:44,498 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 26#L25-2 [2020-06-22 02:28:44,498 INFO L796 eck$LassoCheckResult]: Loop: 26#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 27#L17 [67] L17-->L23: Formula: (> v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~bn~0_7) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 28#L23 [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26#L25-2 [2020-06-22 02:28:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 2 times [2020-06-22 02:28:44,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,506 INFO L82 PathProgramCache]: Analyzing trace with hash 89574, now seen corresponding path program 1 times [2020-06-22 02:28:44,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:28:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:44,519 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 02:28:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:28:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:28:44,520 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:28:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:28:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:28:44,520 INFO L87 Difference]: Start difference. First operand 10 states and 26 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-06-22 02:28:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:28:44,577 INFO L93 Difference]: Finished difference Result 13 states and 30 transitions. [2020-06-22 02:28:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:28:44,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 30 transitions. [2020-06-22 02:28:44,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 02:28:44,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 30 transitions. [2020-06-22 02:28:44,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:28:44,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 02:28:44,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 30 transitions. [2020-06-22 02:28:44,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:28:44,581 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. [2020-06-22 02:28:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 30 transitions. [2020-06-22 02:28:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 02:28:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 02:28:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2020-06-22 02:28:44,584 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. [2020-06-22 02:28:44,584 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. [2020-06-22 02:28:44,584 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:28:44,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 30 transitions. [2020-06-22 02:28:44,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 02:28:44,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:44,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:44,585 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:28:44,585 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:44,586 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 55#L25-2 [2020-06-22 02:28:44,586 INFO L796 eck$LassoCheckResult]: Loop: 55#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 65#L17 [67] L17-->L23: Formula: (> v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~bn~0_7) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 66#L23 [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 55#L25-2 [2020-06-22 02:28:44,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 3 times [2020-06-22 02:28:44,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:44,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 90535, now seen corresponding path program 1 times [2020-06-22 02:28:44,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:28:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2175905, now seen corresponding path program 1 times [2020-06-22 02:28:44,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:44,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:44,651 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:44,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:44,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:44,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:44,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:28:44,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:44,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:44,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:44,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:28:44,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:44,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:44,671 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 02:28:44,680 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 02:28:44,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:44,743 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:44,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:44,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:44,782 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:28:44,782 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:44,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:44,788 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:44,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:28:44,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:44,998 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:28:45,001 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:45,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:45,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:45,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:45,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:28:45,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:28:45,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:45,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:45,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:28:45,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:45,002 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:45,003 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 02:28:45,007 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 02:28:45,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:45,052 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:28:45,054 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 02:28:45,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:45,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:45,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:45,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:45,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:45,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:45,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:45,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:28:45,064 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 02:28:45,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:45,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:45,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:45,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:45,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:45,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:45,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:45,071 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:28:45,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:28:45,077 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:28:45,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:28:45,079 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:28:45,080 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:28:45,080 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~an~0) = -2*ULTIMATE.start_main_~i~0 + 2*ULTIMATE.start_main_~an~0 + 1 Supporting invariants [] [2020-06-22 02:28:45,081 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:28:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:45,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:28:45,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:45,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:45,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:45,149 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 02:28:45,169 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:28:45,172 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 2 loop predicates [2020-06-22 02:28:45,173 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 30 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-06-22 02:28:45,266 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 30 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 29 states and 73 transitions. Complement of second has 6 states. [2020-06-22 02:28:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:28:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:28:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-06-22 02:28:45,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 02:28:45,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:45,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:28:45,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:45,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 02:28:45,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:45,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 73 transitions. [2020-06-22 02:28:45,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 02:28:45,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 73 transitions. [2020-06-22 02:28:45,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:28:45,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 02:28:45,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 73 transitions. [2020-06-22 02:28:45,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:28:45,281 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 73 transitions. [2020-06-22 02:28:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 73 transitions. [2020-06-22 02:28:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-06-22 02:28:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 02:28:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2020-06-22 02:28:45,285 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 68 transitions. [2020-06-22 02:28:45,285 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 68 transitions. [2020-06-22 02:28:45,285 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:28:45,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 68 transitions. [2020-06-22 02:28:45,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 02:28:45,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:45,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:45,287 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:28:45,287 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:45,288 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 133#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 134#L17 [2020-06-22 02:28:45,288 INFO L796 eck$LassoCheckResult]: Loop: 134#L17 [41] L17-->L18: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 135#L18 [68] L18-->L25-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_7 (+ v_ULTIMATE.start_main_~j~0_8 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 147#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 134#L17 [2020-06-22 02:28:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2261, now seen corresponding path program 1 times [2020-06-22 02:28:45,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:45,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:45,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 71360, now seen corresponding path program 1 times [2020-06-22 02:28:45,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 67399020, now seen corresponding path program 1 times [2020-06-22 02:28:45,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:45,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:45,344 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:45,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:45,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:45,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:45,345 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:28:45,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:45,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:45,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:45,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:28:45,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:45,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:45,347 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 02:28:45,353 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 02:28:45,356 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 02:28:45,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:45,382 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:45,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:45,389 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:45,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:28:45,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:45,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:28:45,922 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:45,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:45,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:45,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:45,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:28:45,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:28:45,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:45,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:45,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:28:45,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:45,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:45,925 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 02:28:45,932 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 02:28:45,935 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 02:28:45,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:45,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:28:45,961 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 02:28:45,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:45,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:45,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:45,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:45,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:45,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:45,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:45,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:28:45,975 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 02:28:45,975 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:28:45,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:28:45,976 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:28:45,976 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:28:45,976 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~bn~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 02:28:45,977 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:28:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:45,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:28:45,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:46,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:46,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,020 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 02:28:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:46,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:46,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,052 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:28:46,053 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:28:46,053 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 68 transitions. cyclomatic complexity: 45 Second operand 4 states. [2020-06-22 02:28:46,169 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 68 transitions. cyclomatic complexity: 45. Second operand 4 states. Result 86 states and 203 transitions. Complement of second has 10 states. [2020-06-22 02:28:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 02:28:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:28:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-06-22 02:28:46,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 02:28:46,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 02:28:46,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 02:28:46,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 203 transitions. [2020-06-22 02:28:46,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 02:28:46,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 26 states and 56 transitions. [2020-06-22 02:28:46,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:28:46,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 02:28:46,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 56 transitions. [2020-06-22 02:28:46,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:28:46,181 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. [2020-06-22 02:28:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 56 transitions. [2020-06-22 02:28:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 02:28:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 02:28:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2020-06-22 02:28:46,184 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. [2020-06-22 02:28:46,184 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. [2020-06-22 02:28:46,184 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:28:46,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 56 transitions. [2020-06-22 02:28:46,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 02:28:46,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:46,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:46,186 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:28:46,186 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:28:46,186 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 299#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 317#L17 [2020-06-22 02:28:46,186 INFO L796 eck$LassoCheckResult]: Loop: 317#L17 [41] L17-->L18: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 301#L18 [68] L18-->L25-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_7 (+ v_ULTIMATE.start_main_~j~0_8 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 311#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 317#L17 [2020-06-22 02:28:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2262, now seen corresponding path program 1 times [2020-06-22 02:28:46,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:46,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:46,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:46,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 71361, now seen corresponding path program 1 times [2020-06-22 02:28:46,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash 67428812, now seen corresponding path program 1 times [2020-06-22 02:28:46,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:46,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,236 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:46,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:46,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:46,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:46,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:28:46,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:46,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:46,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:46,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:28:46,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:46,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:46,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:28:46,242 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 02:28:46,245 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 02:28:46,281 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:46,281 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:46,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:46,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:46,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:28:46,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:46,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:46,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:46,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:28:46,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:46,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:46,356 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 02:28:46,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:28:46,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:46,697 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:28:46,699 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:46,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:46,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:46,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:46,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:28:46,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:28:46,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:46,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:46,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:28:46,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:46,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:46,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 02:28:46,704 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 02:28:46,707 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 02:28:46,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:46,740 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:28:46,741 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 02:28:46,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:46,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:46,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:46,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:46,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:46,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:46,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:46,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:28:46,744 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 02:28:46,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:46,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:46,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:46,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:46,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:46,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:46,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:46,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:28:46,748 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 02:28:46,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:46,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:46,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:46,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:46,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:46,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:46,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:46,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:28:46,757 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:28:46,757 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:28:46,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:28:46,757 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:28:46,758 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:28:46,758 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~bn~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-06-22 02:28:46,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:28:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:46,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:28:46,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:46,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:46,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,844 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 02:28:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:46,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:46,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:46,873 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:28:46,873 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:28:46,873 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 56 transitions. cyclomatic complexity: 33 Second operand 4 states. [2020-06-22 02:28:46,953 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 56 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 80 states and 164 transitions. Complement of second has 11 states. [2020-06-22 02:28:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:28:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:28:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-06-22 02:28:46,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 02:28:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 02:28:46,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 02:28:46,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:46,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 164 transitions. [2020-06-22 02:28:46,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 02:28:46,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 19 states and 31 transitions. [2020-06-22 02:28:46,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 02:28:46,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 02:28:46,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 31 transitions. [2020-06-22 02:28:46,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:28:46,962 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 02:28:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 31 transitions. [2020-06-22 02:28:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-06-22 02:28:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 02:28:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-06-22 02:28:46,964 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 02:28:46,965 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 02:28:46,965 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:28:46,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. [2020-06-22 02:28:46,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 02:28:46,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:28:46,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:28:46,966 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:28:46,966 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:28:46,966 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= 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|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~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_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 456#L25-2 [62] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 467#L17 [2020-06-22 02:28:46,966 INFO L796 eck$LassoCheckResult]: Loop: 467#L17 [66] L17-->L23: Formula: (> v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~an~0_7) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 461#L23 [70] L23-->L25: Formula: (> v_ULTIMATE.start_main_~i~0_12 v_ULTIMATE.start_main_~an~0_9) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 462#L25 [53] L25-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~an~0_10 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (<= v_ULTIMATE.start_main_~j~0_13 v_ULTIMATE.start_main_~bn~0_10)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 466#L25-2 [62] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 467#L17 [2020-06-22 02:28:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2263, now seen corresponding path program 1 times [2020-06-22 02:28:46,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:46,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:46,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:46,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2958702, now seen corresponding path program 1 times [2020-06-22 02:28:46,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:46,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:47,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:47,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:47,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2091963204, now seen corresponding path program 1 times [2020-06-22 02:28:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:28:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:28:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:47,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:28:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:28:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:28:47,039 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:47,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:47,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:47,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:47,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:28:47,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:47,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:47,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:47,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:28:47,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:47,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:47,042 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 02:28:47,046 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 02:28:47,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:47,077 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 02:28:47,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:47,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:47,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:28:47,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=1} Honda state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:47,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:28:47,116 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:28:47,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:28:47,147 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:28:47,609 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:28:47,612 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:28:47,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:28:47,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:28:47,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:28:47,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:28:47,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:28:47,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:28:47,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:28:47,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:28:47,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:28:47,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:28:47,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:28:47,617 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 02:28:47,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:28:47,641 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:28:47,641 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 02:28:47,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:47,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:47,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:47,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:47,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:47,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:47,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:47,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:28:47,645 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 02:28:47,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:28:47,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:28:47,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:28:47,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:28:47,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:28:47,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:28:47,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:28:47,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:28:47,652 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:28:47,653 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:28:47,653 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:28:47,653 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:28:47,653 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:28:47,653 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~bn~0 Supporting invariants [] [2020-06-22 02:28:47,654 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:28:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:28:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:47,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:28:47,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:47,695 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 02:28:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:28:47,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:28:47,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:28:47,728 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:28:47,728 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:28:47,728 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-06-22 02:28:47,778 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 41 states and 71 transitions. Complement of second has 8 states. [2020-06-22 02:28:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 02:28:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:28:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 02:28:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 02:28:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 02:28:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 02:28:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:28:47,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 71 transitions. [2020-06-22 02:28:47,783 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:28:47,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:28:47,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:28:47,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:28:47,784 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:28:47,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:28:47,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:28:47,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:28:47,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:28:47 BasicIcfg [2020-06-22 02:28:47,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:28:47,791 INFO L168 Benchmark]: Toolchain (without parser) took 4439.58 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 564.9 MB in the beginning and 646.7 MB in the end (delta: -81.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,793 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:28:47,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.18 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 564.9 MB in the beginning and 644.5 MB in the end (delta: -79.6 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.14 ms. Allocated memory is still 676.9 MB. Free memory was 644.5 MB in the beginning and 643.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,794 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 676.9 MB. Free memory was 643.4 MB in the beginning and 641.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,795 INFO L168 Benchmark]: RCFGBuilder took 213.38 ms. Allocated memory is still 676.9 MB. Free memory was 641.3 MB in the beginning and 624.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,795 INFO L168 Benchmark]: BlockEncodingV2 took 85.04 ms. Allocated memory is still 676.9 MB. Free memory was 624.9 MB in the beginning and 618.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,796 INFO L168 Benchmark]: TraceAbstraction took 157.54 ms. Allocated memory is still 676.9 MB. Free memory was 618.4 MB in the beginning and 608.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,796 INFO L168 Benchmark]: BuchiAutomizer took 3628.04 ms. Allocated memory was 676.9 MB in the beginning and 750.8 MB in the end (delta: 73.9 MB). Free memory was 608.6 MB in the beginning and 646.7 MB in the end (delta: -38.1 MB). Peak memory consumption was 35.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:28:47,801 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 15 edges - StatisticsResult: Encoded RCFG 6 locations, 16 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 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.18 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 564.9 MB in the beginning and 644.5 MB in the end (delta: -79.6 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.14 ms. Allocated memory is still 676.9 MB. Free memory was 644.5 MB in the beginning and 643.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 676.9 MB. Free memory was 643.4 MB in the beginning and 641.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 213.38 ms. Allocated memory is still 676.9 MB. Free memory was 641.3 MB in the beginning and 624.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 85.04 ms. Allocated memory is still 676.9 MB. Free memory was 624.9 MB in the beginning and 618.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 157.54 ms. Allocated memory is still 676.9 MB. Free memory was 618.4 MB in the beginning and 608.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3628.04 ms. Allocated memory was 676.9 MB in the beginning and 750.8 MB in the end (delta: 73.9 MB). Free memory was 608.6 MB in the beginning and 646.7 MB in the end (delta: -38.1 MB). Peak memory consumption was 35.8 MB. 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: 16]: 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 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * i + 2 * an + 1 and consists of 4 locations. One nondeterministic module has affine ranking function bn + -1 * j and consists of 5 locations. One nondeterministic module has affine ranking function 2 * bn + -2 * j + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + bn and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 147 SDslu, 28 SDs, 0 SdLazy, 247 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:28:40.114 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:28:48.032 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check