YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:14:09,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:14:09,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:14:09,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:14:09,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:14:09,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:14:09,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:14:09,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:14:09,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:14:09,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:14:09,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:14:09,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:14:09,344 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:14:09,345 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:14:09,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:14:09,347 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:14:09,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:14:09,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:14:09,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:14:09,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:14:09,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:14:09,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:14:09,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:14:09,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:14:09,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:14:09,358 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:14:09,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:14:09,359 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:14:09,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:14:09,360 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:14:09,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:14:09,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:14:09,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:14:09,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:14:09,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:14:09,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:14:09,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:14:09,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:14:09,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:14:09,365 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 02:14:09,380 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:14:09,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:14:09,381 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:14:09,381 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:14:09,381 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:14:09,382 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:14:09,382 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:14:09,383 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:14:09,383 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:14:09,383 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:09,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:14:09,383 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:14:09,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:14:09,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:14:09,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:14:09,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:14:09,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:14:09,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:14:09,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:14:09,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:14:09,423 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:14:09,426 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:14:09,429 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:14:09,429 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:14:09,430 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:14:09,496 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/12b3871c734a4207aee0a796165825a5/FLAG0f9a0aed0 [2020-06-22 02:14:09,825 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:14:09,825 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:14:09,832 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/12b3871c734a4207aee0a796165825a5/FLAG0f9a0aed0 [2020-06-22 02:14:10,252 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/12b3871c734a4207aee0a796165825a5 [2020-06-22 02:14:10,263 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:14:10,264 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:14:10,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:14:10,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:14:10,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:14:10,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ada8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10, skipping insertion in model container [2020-06-22 02:14:10,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:14:10,300 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:14:10,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:14:10,466 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:14:10,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:14:10,570 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:14:10,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10 WrapperNode [2020-06-22 02:14:10,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:14:10,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:14:10,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:14:10,572 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:14:10,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:14:10,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:14:10,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:14:10,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:14:10,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:14:10,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:14:10,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:14:10,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:14:10,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:14:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:14:10,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:14:10,894 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:14:10,894 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 02:14:10,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:14:10 BoogieIcfgContainer [2020-06-22 02:14:10,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:14:10,896 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:14:10,897 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:14:10,899 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:14:10,900 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:14:10" (1/1) ... [2020-06-22 02:14:10,915 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 25 edges [2020-06-22 02:14:10,917 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:14:10,918 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:14:10,918 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:14:10,918 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:14:10,920 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:14:10,921 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:14:10,921 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:14:10,940 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:14:10,959 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 02:14:10,964 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:14:10,965 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:14:10,976 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:14:10,978 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 02:14:10,979 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:14:10,979 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:14:10,979 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:14:10,980 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:14:10,980 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 21 edges [2020-06-22 02:14:10,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:14:10 BasicIcfg [2020-06-22 02:14:10,981 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:14:10,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:14:10,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:14:10,985 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:14:10,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:14:10" (1/4) ... [2020-06-22 02:14:10,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faf7e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:14:10, skipping insertion in model container [2020-06-22 02:14:10,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (2/4) ... [2020-06-22 02:14:10,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faf7e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:14:10, skipping insertion in model container [2020-06-22 02:14:10,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:14:10" (3/4) ... [2020-06-22 02:14:10,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faf7e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:14:10, skipping insertion in model container [2020-06-22 02:14:10,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:14:10" (4/4) ... [2020-06-22 02:14:10,990 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:14:11,000 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:14:11,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:14:11,028 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:14:11,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:14:11,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:14:11,056 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:14:11,057 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:14:11,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:14:11,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:14:11,057 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:14:11,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:14:11,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:14:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-22 02:14:11,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:14:11,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-06-22 02:14:11,085 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,085 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:14:11,085 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,085 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,086 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 13 69) no Hoare annotation was computed. [2020-06-22 02:14:11,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:14:11 BasicIcfg [2020-06-22 02:14:11,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:14:11,090 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:14:11,090 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:14:11,094 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:14:11,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:14:11,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:14:10" (1/5) ... [2020-06-22 02:14:11,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45017d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:14:11, skipping insertion in model container [2020-06-22 02:14:11,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:14:11,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:14:10" (2/5) ... [2020-06-22 02:14:11,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45017d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:14:11, skipping insertion in model container [2020-06-22 02:14:11,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:14:11,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:14:10" (3/5) ... [2020-06-22 02:14:11,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45017d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:14:11, skipping insertion in model container [2020-06-22 02:14:11,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:14:11,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:14:10" (4/5) ... [2020-06-22 02:14:11,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45017d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:14:11, skipping insertion in model container [2020-06-22 02:14:11,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:14:11,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:14:11" (5/5) ... [2020-06-22 02:14:11,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:14:11,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:14:11,127 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:14:11,127 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:14:11,127 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:14:11,127 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:14:11,128 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:14:11,128 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:14:11,128 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:14:11,128 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:14:11,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 02:14:11,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:11,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:11,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:11,157 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:11,157 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:11,158 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:14:11,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 02:14:11,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:11,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:11,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:11,160 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:11,160 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:11,166 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~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_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 13#L19true [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 9#L19-2true [75] L19-2-->L24-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 12#L24-1true [92] L24-1-->L29-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= v_ULTIMATE.start_main_~x~0_10 (+ v_ULTIMATE.start_main_~x~0_11 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 11#L29-1true [77] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_14 (+ v_ULTIMATE.start_main_~x~0_15 1)) (< 0 v_ULTIMATE.start_main_~x~0_15)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 10#L34-1true [90] L34-1-->L39-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 8#L39-1true [73] L39-1-->L44-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= v_ULTIMATE.start_main_~x~0_22 (+ v_ULTIMATE.start_main_~x~0_23 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 7#L44-1true [88] L44-1-->L49-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= v_ULTIMATE.start_main_~x~0_26 (+ v_ULTIMATE.start_main_~x~0_27 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 6#L49-1true [103] L49-1-->L54-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_33) (= v_ULTIMATE.start_main_~x~0_32 (+ v_ULTIMATE.start_main_~x~0_33 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 4#L54-1true [104] L54-1-->L64-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_36 (+ v_ULTIMATE.start_main_~x~0_37 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_37} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 3#L64-1true [2020-06-22 02:14:11,166 INFO L796 eck$LassoCheckResult]: Loop: 3#L64-1true [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 3#L64-1true [2020-06-22 02:14:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1935283229, now seen corresponding path program 1 times [2020-06-22 02:14:11,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:11,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:14:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:14:11,334 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 02:14:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2020-06-22 02:14:11,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:14:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:14:11,417 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-06-22 02:14:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:14:11,508 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2020-06-22 02:14:11,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:14:11,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. [2020-06-22 02:14:11,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 02:14:11,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 02:14:11,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 02:14:11,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 02:14:11,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. [2020-06-22 02:14:11,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:11,521 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 02:14:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. [2020-06-22 02:14:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 02:14:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 02:14:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 02:14:11,552 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 02:14:11,552 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 02:14:11,552 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:14:11,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 02:14:11,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:11,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:11,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:11,555 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:11,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:11,556 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~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_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 43#L19 [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 46#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 47#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 51#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 56#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 54#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 52#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 53#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 40#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 39#L64-1 [2020-06-22 02:14:11,556 INFO L796 eck$LassoCheckResult]: Loop: 39#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 39#L64-1 [2020-06-22 02:14:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -578183610, now seen corresponding path program 1 times [2020-06-22 02:14:11,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:11,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:14:11,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:14:11,575 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 02:14:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 2 times [2020-06-22 02:14:11,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:14:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:14:11,618 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 02:14:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:14:11,688 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 02:14:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:14:11,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2020-06-22 02:14:11,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 02:14:11,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 02:14:11,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 02:14:11,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:14:11,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2020-06-22 02:14:11,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:11,693 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 02:14:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2020-06-22 02:14:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 02:14:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 02:14:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 02:14:11,695 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 02:14:11,696 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 02:14:11,696 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:14:11,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 29 transitions. [2020-06-22 02:14:11,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:11,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:11,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:11,698 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:11,698 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:11,698 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~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_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 87#L19 [80] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 94#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 95#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 101#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 100#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 99#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 98#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 96#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 84#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 83#L64-1 [2020-06-22 02:14:11,699 INFO L796 eck$LassoCheckResult]: Loop: 83#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 83#L64-1 [2020-06-22 02:14:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash 978446635, now seen corresponding path program 1 times [2020-06-22 02:14:11,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:11,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:11,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:14:11,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:14:11,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 02:14:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 3 times [2020-06-22 02:14:11,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:14:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:14:11,763 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 02:14:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:14:11,807 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-06-22 02:14:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:14:11,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-06-22 02:14:11,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 02:14:11,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-06-22 02:14:11,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 02:14:11,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:14:11,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-06-22 02:14:11,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:11,810 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-06-22 02:14:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-06-22 02:14:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 02:14:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 02:14:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-06-22 02:14:11,813 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-06-22 02:14:11,813 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-06-22 02:14:11,813 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:14:11,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-06-22 02:14:11,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:11,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:11,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:11,815 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:11,815 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:11,815 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~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_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 131#L19 [80] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 140#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 141#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 144#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 145#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 146#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 142#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 143#L49-1 [103] L49-1-->L54-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_33) (= v_ULTIMATE.start_main_~x~0_32 (+ v_ULTIMATE.start_main_~x~0_33 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 129#L54-1 [104] L54-1-->L64-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_36 (+ v_ULTIMATE.start_main_~x~0_37 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_37} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 128#L64-1 [2020-06-22 02:14:11,816 INFO L796 eck$LassoCheckResult]: Loop: 128#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 128#L64-1 [2020-06-22 02:14:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash 978447646, now seen corresponding path program 1 times [2020-06-22 02:14:11,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:11,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 4 times [2020-06-22 02:14:11,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 267106038, now seen corresponding path program 1 times [2020-06-22 02:14:11,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:11,989 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:11,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:11,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:11,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:11,991 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:11,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:11,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:11,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:11,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 02:14:11,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:11,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,135 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:12,136 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:12,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:12,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:12,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:12,187 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:12,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:12,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:12,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:12,198 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:12,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:12,228 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:12,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:12,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:12,612 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:12,615 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:12,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:12,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:12,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:12,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:12,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:12,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:12,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:12,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 02:14:12,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:12,616 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:12,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:12,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:12,715 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:12,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:12,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:12,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:12,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:12,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:12,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:14:12,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:14:12,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:12,763 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:12,763 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:14:12,766 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:12,769 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 02:14:12,770 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:12,770 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = -2*ULTIMATE.start_main_~z~0 + 207 Supporting invariants [-1*ULTIMATE.start_main_~x~0 - 9 >= 0] [2020-06-22 02:14:12,774 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 02:14:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:12,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 02:14:12,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:13,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:14:13,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:13,135 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:14:13,138 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2020-06-22 02:14:13,139 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-06-22 02:14:13,354 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3. Second operand 10 states. Result 21 states and 23 transitions. Complement of second has 10 states. [2020-06-22 02:14:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2020-06-22 02:14:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:14:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-06-22 02:14:13,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. [2020-06-22 02:14:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 11 letters. Loop has 1 letters. [2020-06-22 02:14:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2020-06-22 02:14:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:13,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-06-22 02:14:13,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:13,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 12 transitions. [2020-06-22 02:14:13,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:14:13,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 02:14:13,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-06-22 02:14:13,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:13,368 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:14:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-06-22 02:14:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 02:14:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 02:14:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 02:14:13,370 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:14:13,370 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:14:13,370 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:14:13,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-06-22 02:14:13,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:14:13,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:13,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:13,371 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:14:13,371 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:14:13,372 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~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_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 263#L19 [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 267#L19-2 [75] L19-2-->L24-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 268#L24-1 [92] L24-1-->L29-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= v_ULTIMATE.start_main_~x~0_10 (+ v_ULTIMATE.start_main_~x~0_11 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 269#L29-1 [77] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_14 (+ v_ULTIMATE.start_main_~x~0_15 1)) (< 0 v_ULTIMATE.start_main_~x~0_15)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 266#L34-1 [90] L34-1-->L39-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 265#L39-1 [73] L39-1-->L44-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= v_ULTIMATE.start_main_~x~0_22 (+ v_ULTIMATE.start_main_~x~0_23 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 264#L44-1 [88] L44-1-->L49-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= v_ULTIMATE.start_main_~x~0_26 (+ v_ULTIMATE.start_main_~x~0_27 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 261#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 260#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 259#L64-1 [2020-06-22 02:14:13,372 INFO L796 eck$LassoCheckResult]: Loop: 259#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 259#L64-1 [2020-06-22 02:14:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1935284240, now seen corresponding path program 1 times [2020-06-22 02:14:13,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 5 times [2020-06-22 02:14:13,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash 135730788, now seen corresponding path program 1 times [2020-06-22 02:14:13,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:13,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:13,511 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:13,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:13,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:13,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:13,511 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:13,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:13,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:13,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 02:14:13,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:13,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:13,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:13,594 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,626 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,627 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,724 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,733 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:13,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:13,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:13,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:13,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:13,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:14,175 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:14,178 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:14,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:14,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:14,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:14,178 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:14,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:14,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:14,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:14,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 02:14:14,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:14,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:14,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:14,251 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:14,252 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:14,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:14:14,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:14:14,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:14,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:14,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:14,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:14,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:14,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:14,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:14,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:14,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:14,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:14:14,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:14:14,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:14,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:14,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:14,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:14,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:14,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:14,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:14,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:14,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:14,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:14:14,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:14:14,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:14,299 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:14,299 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:14:14,300 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:14,302 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 02:14:14,302 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:14,302 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 207 Supporting invariants [1*ULTIMATE.start_main_~x~0 - 9 >= 0] [2020-06-22 02:14:14,304 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 02:14:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:14,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 02:14:14,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:14,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:14:14,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:14,534 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:14:14,534 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2020-06-22 02:14:14,534 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-06-22 02:14:14,670 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 12 states and 13 transitions. Complement of second has 10 states. [2020-06-22 02:14:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2020-06-22 02:14:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:14:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-06-22 02:14:14,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 1 letters. [2020-06-22 02:14:14,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:14,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. [2020-06-22 02:14:14,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:14,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-06-22 02:14:14,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:14,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-06-22 02:14:14,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:14:14,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2020-06-22 02:14:14,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:14:14,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:14:14,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:14:14,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:14,675 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:14,675 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:14,675 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:14,675 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:14:14,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:14:14,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:14:14,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:14:14,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:14:14 BasicIcfg [2020-06-22 02:14:14,681 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:14:14,682 INFO L168 Benchmark]: Toolchain (without parser) took 4418.33 ms. Allocated memory was 649.6 MB in the beginning and 736.6 MB in the end (delta: 87.0 MB). Free memory was 559.8 MB in the beginning and 498.1 MB in the end (delta: 61.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,683 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:14:14,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.35 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 559.8 MB in the beginning and 628.4 MB in the end (delta: -68.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.92 ms. Allocated memory is still 662.7 MB. Free memory was 628.4 MB in the beginning and 627.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,685 INFO L168 Benchmark]: Boogie Preprocessor took 21.57 ms. Allocated memory is still 662.7 MB. Free memory was 627.3 MB in the beginning and 623.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,686 INFO L168 Benchmark]: RCFGBuilder took 264.68 ms. Allocated memory is still 662.7 MB. Free memory was 623.4 MB in the beginning and 606.7 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,686 INFO L168 Benchmark]: BlockEncodingV2 took 84.68 ms. Allocated memory is still 662.7 MB. Free memory was 606.7 MB in the beginning and 601.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,687 INFO L168 Benchmark]: TraceAbstraction took 107.78 ms. Allocated memory is still 662.7 MB. Free memory was 600.2 MB in the beginning and 592.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,687 INFO L168 Benchmark]: BuchiAutomizer took 3591.28 ms. Allocated memory was 662.7 MB in the beginning and 736.6 MB in the end (delta: 73.9 MB). Free memory was 592.6 MB in the beginning and 498.1 MB in the end (delta: 94.5 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:14,691 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 25 edges - StatisticsResult: Encoded RCFG 11 locations, 21 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.35 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 559.8 MB in the beginning and 628.4 MB in the end (delta: -68.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.92 ms. Allocated memory is still 662.7 MB. Free memory was 628.4 MB in the beginning and 627.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.57 ms. Allocated memory is still 662.7 MB. Free memory was 627.3 MB in the beginning and 623.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. * RCFGBuilder took 264.68 ms. Allocated memory is still 662.7 MB. Free memory was 623.4 MB in the beginning and 606.7 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 84.68 ms. Allocated memory is still 662.7 MB. Free memory was 606.7 MB in the beginning and 601.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 107.78 ms. Allocated memory is still 662.7 MB. Free memory was 600.2 MB in the beginning and 592.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3591.28 ms. Allocated memory was 662.7 MB in the beginning and 736.6 MB in the end (delta: 73.9 MB). Free memory was 592.6 MB in the beginning and 498.1 MB in the end (delta: 94.5 MB). Peak memory consumption was 168.4 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 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=11occurred 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, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * z + 207 and consists of 10 locations. One nondeterministic module has affine ranking function -2 * y + 207 and consists of 10 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 28 SDslu, 0 SDs, 0 SdLazy, 157 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax156 hnf94 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf94 smp100 dnf100 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 53ms VariablesStem: 1 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:14:07.036 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:14:14.923 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check