YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 00:16:57,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 00:16:57,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 00:16:57,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 00:16:57,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 00:16:57,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 00:16:57,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 00:16:57,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 00:16:57,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 00:16:57,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 00:16:57,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 00:16:57,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 00:16:57,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 00:16:57,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 00:16:57,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 00:16:57,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 00:16:57,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 00:16:57,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 00:16:57,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 00:16:57,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 00:16:57,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 00:16:57,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 00:16:57,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 00:16:57,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 00:16:57,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 00:16:57,291 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 00:16:57,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 00:16:57,292 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 00:16:57,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 00:16:57,293 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 00:16:57,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 00:16:57,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 00:16:57,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 00:16:57,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 00:16:57,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 00:16:57,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 00:16:57,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 00:16:57,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 00:16:57,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 00:16:57,299 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 00:16:57,313 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 00:16:57,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 00:16:57,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 00:16:57,315 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 00:16:57,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 00:16:57,315 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:16:57,315 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 00:16:57,315 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 00:16:57,316 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 00:16:57,317 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:57,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 00:16:57,317 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 00:16:57,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 00:16:57,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 00:16:57,318 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 00:16:57,318 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 00:16:57,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 00:16:57,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 00:16:57,318 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 00:16:57,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 00:16:57,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 00:16:57,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 00:16:57,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 00:16:57,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 00:16:57,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 00:16:57,358 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 00:16:57,361 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 00:16:57,363 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 00:16:57,363 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 00:16:57,364 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 00:16:57,429 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e921dbd432cb4bde96bd46fe4e6be0e6/FLAGf33801715 [2020-06-22 00:16:57,779 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 00:16:57,780 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 00:16:57,786 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e921dbd432cb4bde96bd46fe4e6be0e6/FLAGf33801715 [2020-06-22 00:16:58,198 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e921dbd432cb4bde96bd46fe4e6be0e6 [2020-06-22 00:16:58,219 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 00:16:58,222 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 00:16:58,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 00:16:58,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 00:16:58,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 00:16:58,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63184f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58, skipping insertion in model container [2020-06-22 00:16:58,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 00:16:58,275 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 00:16:58,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:16:58,460 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 00:16:58,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:16:58,554 INFO L195 MainTranslator]: Completed translation [2020-06-22 00:16:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58 WrapperNode [2020-06-22 00:16:58,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 00:16:58,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 00:16:58,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 00:16:58,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 00:16:58,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 00:16:58,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 00:16:58,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 00:16:58,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 00:16:58,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 00:16:58,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 00:16:58,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 00:16:58,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 00:16:58,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 00:16:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 00:16:58,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 00:16:58,858 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 00:16:58,859 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 00:16:58,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:58 BoogieIcfgContainer [2020-06-22 00:16:58,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 00:16:58,861 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 00:16:58,861 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 00:16:58,864 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 00:16:58,864 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:58" (1/1) ... [2020-06-22 00:16:58,879 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 10 edges [2020-06-22 00:16:58,880 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 00:16:58,881 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 00:16:58,882 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 00:16:58,882 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:16:58,884 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 00:16:58,885 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 00:16:58,885 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 00:16:58,900 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 00:16:58,914 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 00:16:58,919 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 00:16:58,921 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:16:58,935 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 00:16:58,938 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 00:16:58,940 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 00:16:58,941 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:16:58,941 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 00:16:58,941 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 00:16:58,942 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges [2020-06-22 00:16:58,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:16:58 BasicIcfg [2020-06-22 00:16:58,943 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 00:16:58,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 00:16:58,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 00:16:58,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 00:16:58,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 12:16:58" (1/4) ... [2020-06-22 00:16:58,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360bddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:16:58, skipping insertion in model container [2020-06-22 00:16:58,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (2/4) ... [2020-06-22 00:16:58,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360bddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:16:58, skipping insertion in model container [2020-06-22 00:16:58,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:58" (3/4) ... [2020-06-22 00:16:58,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360bddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:16:58, skipping insertion in model container [2020-06-22 00:16:58,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:16:58" (4/4) ... [2020-06-22 00:16:58,957 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:16:58,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 00:16:58,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 00:16:59,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 00:16:59,048 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:16:59,049 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 00:16:59,049 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 00:16:59,049 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:16:59,049 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:16:59,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:16:59,050 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 00:16:59,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:16:59,050 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 00:16:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 00:16:59,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 00:16:59,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 00:16:59,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 00:16:59,130 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 16) no Hoare annotation was computed. [2020-06-22 00:16:59,130 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 16) no Hoare annotation was computed. [2020-06-22 00:16:59,130 INFO L451 ceAbstractionStarter]: At program point L11-2(lines 11 18) the Hoare annotation is: true [2020-06-22 00:16:59,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:16:59 BasicIcfg [2020-06-22 00:16:59,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 00:16:59,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 00:16:59,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 00:16:59,143 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 00:16:59,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:16:59,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 12:16:58" (1/5) ... [2020-06-22 00:16:59,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25177478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:16:59, skipping insertion in model container [2020-06-22 00:16:59,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:16:59,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:16:58" (2/5) ... [2020-06-22 00:16:59,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25177478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:16:59, skipping insertion in model container [2020-06-22 00:16:59,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:16:59,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:58" (3/5) ... [2020-06-22 00:16:59,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25177478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:16:59, skipping insertion in model container [2020-06-22 00:16:59,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:16:59,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:16:58" (4/5) ... [2020-06-22 00:16:59,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25177478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:16:59, skipping insertion in model container [2020-06-22 00:16:59,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:16:59,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:16:59" (5/5) ... [2020-06-22 00:16:59,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:16:59,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:16:59,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 00:16:59,179 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 00:16:59,179 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:16:59,179 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:16:59,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:16:59,179 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 00:16:59,179 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:16:59,179 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 00:16:59,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 00:16:59,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:16:59,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:16:59,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:16:59,205 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:16:59,205 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:16:59,206 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 00:16:59,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 00:16:59,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:16:59,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:16:59,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:16:59,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:16:59,207 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:16:59,212 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L11-2true [2020-06-22 00:16:59,212 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-2true [37] L11-2-->L12: Formula: (< v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 5#L12true [36] L12-->L12-2: Formula: (and (>= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~x~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 3#L12-2true [25] L12-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0] 6#L11-2true [2020-06-22 00:16:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:16:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash 57, now seen corresponding path program 1 times [2020-06-22 00:16:59,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:16:59,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:16:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:16:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:16:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 66489, now seen corresponding path program 1 times [2020-06-22 00:16:59,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:16:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:16:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:16:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:16:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1734785, now seen corresponding path program 1 times [2020-06-22 00:16:59,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:16:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:16:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:16:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:16:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:16:59,382 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:16:59,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:16:59,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:16:59,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:16:59,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:16:59,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:59,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:16:59,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:16:59,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:16:59,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:16:59,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:16:59,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:16:59,543 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:59,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:16:59,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:16:59,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:16:59,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:59,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:16:59,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:16:59,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:16:59,624 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:59,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:16:59,630 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:16:59,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:16:59,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:16:59,835 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:16:59,838 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:16:59,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:16:59,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:16:59,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:16:59,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:16:59,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:16:59,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:16:59,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:16:59,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:16:59,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:16:59,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:16:59,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:16:59,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:16:59,959 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:16:59,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 00:16:59,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:16:59,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:16:59,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:16:59,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:16:59,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:16:59,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:16:59,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:16:59,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 00:16:59,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:16:59,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:16:59,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:16:59,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:16:59,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:16:59,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:16:59,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:16:59,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:16:59,996 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 00:16:59,996 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:16:59,998 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:16:59,998 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:16:59,999 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:16:59,999 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 00:17:00,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:17:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:00,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:17:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:17:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:00,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:17:00,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:17:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:17:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:00,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:17:00,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:17:00,116 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:17:00,122 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 00:17:00,123 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. [2020-06-22 00:17:00,196 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 20 states and 31 transitions. Complement of second has 6 states. [2020-06-22 00:17:00,197 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 00:17:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:17:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-06-22 00:17:00,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 00:17:00,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:00,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 00:17:00,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:00,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 00:17:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:00,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 31 transitions. [2020-06-22 00:17:00,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:17:00,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 00:17:00,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 00:17:00,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 00:17:00,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2020-06-22 00:17:00,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:17:00,221 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 00:17:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2020-06-22 00:17:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-06-22 00:17:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 00:17:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 00:17:00,251 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 00:17:00,251 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 00:17:00,251 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 00:17:00,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 28 transitions. [2020-06-22 00:17:00,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:17:00,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:17:00,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:17:00,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 00:17:00,253 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:17:00,254 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 75#L11-2 [37] L11-2-->L12: Formula: (< v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 80#L12 [2020-06-22 00:17:00,254 INFO L796 eck$LassoCheckResult]: Loop: 80#L12 [27] L12-->L12-2: Formula: (and (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 70#L12-2 [25] L12-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0] 71#L11-2 [37] L11-2-->L12: Formula: (< v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 80#L12 [2020-06-22 00:17:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1804, now seen corresponding path program 1 times [2020-06-22 00:17:00,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 56550, now seen corresponding path program 1 times [2020-06-22 00:17:00,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:17:00,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 00:17:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 00:17:00,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 00:17:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 00:17:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 00:17:00,308 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-06-22 00:17:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 00:17:00,326 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-06-22 00:17:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 00:17:00,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2020-06-22 00:17:00,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:17:00,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 25 transitions. [2020-06-22 00:17:00,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 00:17:00,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 00:17:00,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-06-22 00:17:00,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:17:00,332 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-06-22 00:17:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-06-22 00:17:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 00:17:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 00:17:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2020-06-22 00:17:00,334 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-06-22 00:17:00,334 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-06-22 00:17:00,334 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 00:17:00,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2020-06-22 00:17:00,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:17:00,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:17:00,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:17:00,336 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:17:00,336 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:17:00,336 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 119#L11-2 [38] L11-2-->L12: Formula: (> v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 120#L12 [27] L12-->L12-2: Formula: (and (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 113#L12-2 [2020-06-22 00:17:00,336 INFO L796 eck$LassoCheckResult]: Loop: 113#L12-2 [25] L12-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0] 114#L11-2 [38] L11-2-->L12: Formula: (> v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 123#L12 [36] L12-->L12-2: Formula: (and (>= v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~x~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 113#L12-2 [2020-06-22 00:17:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash 55982, now seen corresponding path program 1 times [2020-06-22 00:17:00,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 55030, now seen corresponding path program 1 times [2020-06-22 00:17:00,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:17:00,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 00:17:00,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 00:17:00,387 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 00:17:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 00:17:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 00:17:00,388 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 00:17:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 00:17:00,401 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-06-22 00:17:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 00:17:00,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2020-06-22 00:17:00,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:17:00,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 16 transitions. [2020-06-22 00:17:00,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 00:17:00,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 00:17:00,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-06-22 00:17:00,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:17:00,405 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-06-22 00:17:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-06-22 00:17:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2020-06-22 00:17:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 00:17:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-06-22 00:17:00,407 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-06-22 00:17:00,407 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-06-22 00:17:00,407 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 00:17:00,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-06-22 00:17:00,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:17:00,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:17:00,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:17:00,408 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 00:17:00,408 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:17:00,408 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 154#L11-2 [38] L11-2-->L12: Formula: (> v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 155#L12 [2020-06-22 00:17:00,409 INFO L796 eck$LassoCheckResult]: Loop: 155#L12 [27] L12-->L12-2: Formula: (and (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 149#L12-2 [25] L12-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0] 150#L11-2 [38] L11-2-->L12: Formula: (> v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_7) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 155#L12 [2020-06-22 00:17:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1805, now seen corresponding path program 1 times [2020-06-22 00:17:00,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 56551, now seen corresponding path program 1 times [2020-06-22 00:17:00,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash 53799515, now seen corresponding path program 1 times [2020-06-22 00:17:00,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:17:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:17:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:17:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:17:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:17:00,456 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:17:00,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:17:00,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:17:00,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:17:00,457 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:17:00,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:17:00,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:17:00,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:17:00,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 00:17:00,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:17:00,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:17:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:00,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:00,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:00,532 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:17:00,532 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:17:00,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:17:00,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:17:00,566 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:17:00,566 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 00:17:00,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:17:00,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:17:00,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:17:00,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:17:00,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:17:00,608 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:17:00,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:17:00,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:17:01,074 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:17:01,077 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:17:01,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:17:01,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:17:01,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:17:01,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:17:01,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:17:01,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:17:01,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:17:01,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 00:17:01,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:17:01,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:17:01,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:01,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:01,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:01,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 00:17:01,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:17:01,163 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:17:01,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 00:17:01,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:17:01,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:17:01,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:17:01,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:17:01,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:17:01,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:17:01,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:17:01,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 00:17:01,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:17:01,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:17:01,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:17:01,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:17:01,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:17:01,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:17:01,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:17:01,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 00:17:01,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:17:01,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:17:01,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:17:01,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:17:01,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:17:01,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:17:01,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:17:01,187 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:17:01,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:17:01,190 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:17:01,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:17:01,191 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:17:01,191 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:17:01,191 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 00:17:01,192 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:17:01,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:17:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:17:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:17:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:17:01,225 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:17:01,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:17:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:17:01,235 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 00:17:01,236 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 00:17:01,236 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-22 00:17:01,249 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 6 states. [2020-06-22 00:17:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 00:17:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 00:17:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 00:17:01,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 00:17:01,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:01,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 00:17:01,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:01,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 00:17:01,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:17:01,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-06-22 00:17:01,255 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:17:01,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-06-22 00:17:01,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 00:17:01,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 00:17:01,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 00:17:01,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 00:17:01,255 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:17:01,256 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:17:01,256 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:17:01,256 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 00:17:01,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 00:17:01,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:17:01,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 00:17:01,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:17:01 BasicIcfg [2020-06-22 00:17:01,264 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 00:17:01,264 INFO L168 Benchmark]: Toolchain (without parser) took 3044.17 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 565.3 MB in the beginning and 459.8 MB in the end (delta: 105.4 MB). Peak memory consumption was 141.6 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,266 INFO L168 Benchmark]: CDTParser took 0.16 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 00:17:01,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.04 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 565.3 MB in the beginning and 653.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.27 ms. Allocated memory is still 685.8 MB. Free memory was 652.2 MB in the beginning and 649.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,268 INFO L168 Benchmark]: Boogie Preprocessor took 21.63 ms. Allocated memory is still 685.8 MB. Free memory was 649.1 MB in the beginning and 647.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,269 INFO L168 Benchmark]: RCFGBuilder took 240.44 ms. Allocated memory is still 685.8 MB. Free memory was 647.8 MB in the beginning and 633.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,269 INFO L168 Benchmark]: BlockEncodingV2 took 81.79 ms. Allocated memory is still 685.8 MB. Free memory was 633.5 MB in the beginning and 629.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,270 INFO L168 Benchmark]: TraceAbstraction took 194.53 ms. Allocated memory is still 685.8 MB. Free memory was 628.1 MB in the beginning and 619.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,270 INFO L168 Benchmark]: BuchiAutomizer took 2123.95 ms. Allocated memory is still 685.8 MB. Free memory was 619.9 MB in the beginning and 459.8 MB in the end (delta: 160.0 MB). Peak memory consumption was 160.0 MB. Max. memory is 50.3 GB. [2020-06-22 00:17:01,275 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 10 edges - StatisticsResult: Encoded RCFG 4 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 331.04 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 565.3 MB in the beginning and 653.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.27 ms. Allocated memory is still 685.8 MB. Free memory was 652.2 MB in the beginning and 649.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.63 ms. Allocated memory is still 685.8 MB. Free memory was 649.1 MB in the beginning and 647.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 240.44 ms. Allocated memory is still 685.8 MB. Free memory was 647.8 MB in the beginning and 633.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 81.79 ms. Allocated memory is still 685.8 MB. Free memory was 633.5 MB in the beginning and 629.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 194.53 ms. Allocated memory is still 685.8 MB. Free memory was 628.1 MB in the beginning and 619.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2123.95 ms. Allocated memory is still 685.8 MB. Free memory was 619.9 MB in the beginning and 459.8 MB in the end (delta: 160.0 MB). Peak memory consumption was 160.0 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: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 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=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function y + -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 19 SDslu, 7 SDs, 0 SdLazy, 45 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax179 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 00:16:54.816 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 00:17:01.520 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check