YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:37:10,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:37:10,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:37:10,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:37:10,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:37:10,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:37:10,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:37:10,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:37:10,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:37:10,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:37:10,833 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:37:10,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:37:10,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:37:10,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:37:10,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:37:10,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:37:10,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:37:10,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:37:10,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:37:10,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:37:10,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:37:10,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:37:10,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:37:10,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:37:10,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:37:10,848 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:37:10,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:37:10,849 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:37:10,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:37:10,850 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:37:10,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:37:10,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:37:10,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:37:10,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:37:10,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:37:10,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:37:10,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:37:10,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:37:10,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:37:10,855 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:37:10,869 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:37:10,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:37:10,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:37:10,870 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:37:10,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:37:10,871 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:37:10,871 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:37:10,871 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:37:10,871 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:37:10,871 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:37:10,872 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:37:10,872 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:37:10,872 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:37:10,872 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:37:10,872 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:10,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:37:10,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:37:10,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:37:10,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:37:10,873 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:37:10,873 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:37:10,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:37:10,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:37:10,874 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:37:10,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:37:10,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:37:10,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:37:10,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:37:10,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:37:10,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:37:10,913 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:37:10,916 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:37:10,918 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:37:10,918 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:37:10,919 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:37:10,985 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/f4e06d773e164a0693bbb5cfd92f9055/FLAG7368f979b [2020-06-22 04:37:11,309 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:37:11,310 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:37:11,317 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/f4e06d773e164a0693bbb5cfd92f9055/FLAG7368f979b [2020-06-22 04:37:11,716 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/f4e06d773e164a0693bbb5cfd92f9055 [2020-06-22 04:37:11,728 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:37:11,729 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:37:11,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:37:11,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:37:11,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:37:11,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:37:11" (1/1) ... [2020-06-22 04:37:11,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce2bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:11, skipping insertion in model container [2020-06-22 04:37:11,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:37:11" (1/1) ... [2020-06-22 04:37:11,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:37:11,765 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:37:11,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:37:11,929 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:37:11,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:37:12,024 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:37:12,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12 WrapperNode [2020-06-22 04:37:12,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:37:12,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:37:12,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:37:12,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:37:12,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:37:12,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:37:12,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:37:12,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:37:12,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:37:12,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:37:12,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:37:12,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:37:12,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (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 04:37:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:37:12,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:37:12,360 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:37:12,361 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 04:37:12,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:37:12 BoogieIcfgContainer [2020-06-22 04:37:12,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:37:12,363 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:37:12,363 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:37:12,365 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:37:12,366 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:37:12" (1/1) ... [2020-06-22 04:37:12,381 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 25 edges [2020-06-22 04:37:12,382 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:37:12,383 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:37:12,384 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:37:12,384 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:37:12,386 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:37:12,387 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:37:12,387 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:37:12,406 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:37:12,425 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 04:37:12,430 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 04:37:12,432 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:37:12,442 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 04:37:12,444 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 04:37:12,446 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:37:12,446 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:37:12,446 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:37:12,447 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:37:12,447 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 21 edges [2020-06-22 04:37:12,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:37:12 BasicIcfg [2020-06-22 04:37:12,448 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:37:12,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:37:12,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:37:12,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:37:12,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:37:11" (1/4) ... [2020-06-22 04:37:12,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d002345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (2/4) ... [2020-06-22 04:37:12,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d002345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:37:12" (3/4) ... [2020-06-22 04:37:12,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d002345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:37:12" (4/4) ... [2020-06-22 04:37:12,458 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:37:12,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:37:12,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:37:12,492 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:37:12,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:37:12,521 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:37:12,521 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:37:12,521 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:37:12,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:37:12,522 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:37:12,522 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:37:12,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:37:12,522 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:37:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-22 04:37:12,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:37:12,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-06-22 04:37:12,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:37:12,550 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,550 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,550 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,550 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,550 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,551 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2020-06-22 04:37:12,551 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,551 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,551 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,551 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 11 65) no Hoare annotation was computed. [2020-06-22 04:37:12,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:37:12 BasicIcfg [2020-06-22 04:37:12,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:37:12,555 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:37:12,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:37:12,558 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:37:12,559 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:37:12,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:37:11" (1/5) ... [2020-06-22 04:37:12,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1952311e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:37:12,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:37:12" (2/5) ... [2020-06-22 04:37:12,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1952311e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,561 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:37:12,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:37:12" (3/5) ... [2020-06-22 04:37:12,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1952311e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,561 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:37:12,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:37:12" (4/5) ... [2020-06-22 04:37:12,562 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1952311e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:37:12, skipping insertion in model container [2020-06-22 04:37:12,562 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:37:12,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:37:12" (5/5) ... [2020-06-22 04:37:12,564 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:37:12,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:37:12,591 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:37:12,591 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:37:12,592 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:37:12,592 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:37:12,592 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:37:12,592 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:37:12,592 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:37:12,592 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:37:12,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 04:37:12,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:12,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:12,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:12,620 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:12,620 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:12,621 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:37:12,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 04:37:12,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:12,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:12,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:12,623 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:12,623 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:12,629 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [85] ULTIMATE.startENTRY-->L15: 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~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 3#L15true [107] L15-->L15-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] 10#L15-2true [91] L15-2-->L20-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_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 13#L20-1true [83] L20-1-->L25-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= (+ v_ULTIMATE.start_main_~x~0_11 1) v_ULTIMATE.start_main_~x~0_10)) 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, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5] 12#L25-1true [93] L25-1-->L30-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_15) (= (+ v_ULTIMATE.start_main_~x~0_15 1) v_ULTIMATE.start_main_~x~0_14)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0] 11#L30-1true [100] L30-1-->L35-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_21 (+ v_ULTIMATE.start_main_~x~0_20 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_~x~0] 9#L35-1true [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) 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, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 8#L40-1true [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 7#L45-1true [103] L45-1-->L50-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_33 (+ v_ULTIMATE.start_main_~x~0_32 1)) (>= 0 v_ULTIMATE.start_main_~x~0_33)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_~x~0] 6#L50-1true [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) 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, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 5#L60-1true [2020-06-22 04:37:12,630 INFO L796 eck$LassoCheckResult]: Loop: 5#L60-1true [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 5#L60-1true [2020-06-22 04:37:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1643076434, now seen corresponding path program 1 times [2020-06-22 04:37:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:12,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:12,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:12,796 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 04:37:12,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:37:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:37:12,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 04:37:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2020-06-22 04:37:12,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:37:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:37:12,893 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-06-22 04:37:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:37:12,982 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2020-06-22 04:37:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:37:12,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. [2020-06-22 04:37:12,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 04:37:12,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 04:37:12,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 04:37:12,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 04:37:12,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. [2020-06-22 04:37:12,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:37:12,995 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 04:37:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. [2020-06-22 04:37:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 04:37:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 04:37:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 04:37:13,024 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 04:37:13,025 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 04:37:13,025 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:37:13,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 04:37:13,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:13,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:13,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:13,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:13,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:13,029 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: 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~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 39#L15 [107] L15-->L15-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] 40#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) 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, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 47#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 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_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 51#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 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, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 52#L30-1 [81] L30-1-->L35-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, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 46#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) 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, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 45#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 44#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 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, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 43#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) 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, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 42#L60-1 [2020-06-22 04:37:13,030 INFO L796 eck$LassoCheckResult]: Loop: 42#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 42#L60-1 [2020-06-22 04:37:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash -203082606, now seen corresponding path program 1 times [2020-06-22 04:37:13,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:13,047 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 04:37:13,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:37:13,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:37:13,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 04:37:13,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 2 times [2020-06-22 04:37:13,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:37:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:37:13,081 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 04:37:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:37:13,154 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 04:37:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:37:13,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2020-06-22 04:37:13,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 04:37:13,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 04:37:13,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 04:37:13,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 04:37:13,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2020-06-22 04:37:13,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:37:13,159 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 04:37:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2020-06-22 04:37:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 04:37:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 04:37:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 04:37:13,162 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 04:37:13,162 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 04:37:13,162 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:37:13,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 29 transitions. [2020-06-22 04:37:13,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:13,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:13,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:13,164 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:13,164 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:13,165 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: 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~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 83#L15 [72] L15-->L15-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] 84#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) 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, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 95#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 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_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 96#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 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, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 97#L30-1 [81] L30-1-->L35-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, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 91#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) 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, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 90#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 89#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 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, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 88#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) 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, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 87#L60-1 [2020-06-22 04:37:13,165 INFO L796 eck$LassoCheckResult]: Loop: 87#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 87#L60-1 [2020-06-22 04:37:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1366685841, now seen corresponding path program 1 times [2020-06-22 04:37:13,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:37:13,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:13,187 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 04:37:13,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:37:13,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:37:13,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 04:37:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 3 times [2020-06-22 04:37:13,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:13,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:37:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:37:13,222 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 04:37:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:37:13,275 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-06-22 04:37:13,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:37:13,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-06-22 04:37:13,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-06-22 04:37:13,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-06-22 04:37:13,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 04:37:13,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 04:37:13,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-06-22 04:37:13,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:37:13,278 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-06-22 04:37:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-06-22 04:37:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 04:37:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 04:37:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-06-22 04:37:13,280 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-06-22 04:37:13,280 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-06-22 04:37:13,280 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:37:13,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-06-22 04:37:13,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:13,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:13,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:13,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:13,283 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:13,283 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: 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~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 128#L15 [72] L15-->L15-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] 129#L15-2 [97] L15-2-->L20-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= (+ v_ULTIMATE.start_main_~x~0_8 1) v_ULTIMATE.start_main_~x~0_9)) 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, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 137#L20-1 [98] L20-1-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_13 (+ v_ULTIMATE.start_main_~x~0_12 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_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~x~0] 141#L25-1 [99] L25-1-->L30-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_17 (+ v_ULTIMATE.start_main_~x~0_16 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, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~x~0] 142#L30-1 [100] L30-1-->L35-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_21 (+ v_ULTIMATE.start_main_~x~0_20 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_~x~0] 143#L35-1 [101] L35-1-->L40-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_25 (+ v_ULTIMATE.start_main_~x~0_24 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, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_~x~0] 144#L40-1 [102] L40-1-->L45-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_29) (= v_ULTIMATE.start_main_~x~0_29 (+ v_ULTIMATE.start_main_~x~0_28 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0] 145#L45-1 [103] L45-1-->L50-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_33 (+ v_ULTIMATE.start_main_~x~0_32 1)) (>= 0 v_ULTIMATE.start_main_~x~0_33)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_~x~0] 146#L50-1 [104] L50-1-->L60-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_37 (+ v_ULTIMATE.start_main_~x~0_36 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, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_~x~0] 132#L60-1 [2020-06-22 04:37:13,284 INFO L796 eck$LassoCheckResult]: Loop: 132#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 132#L60-1 [2020-06-22 04:37:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1348758824, now seen corresponding path program 1 times [2020-06-22 04:37:13,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:37:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 4 times [2020-06-22 04:37:13,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1138149492, now seen corresponding path program 1 times [2020-06-22 04:37:13,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:13,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:13,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:37:13,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:13,459 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:37:13,460 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:37:13,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:37:13,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:37:13,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:37:13,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:13,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:37:13,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:37:13,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 04:37:13,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:37:13,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:37:13,481 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 04:37:13,488 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 04:37:13,492 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 04:37:13,497 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 04:37:13,500 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 04:37:13,503 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 04:37:13,505 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 04:37:13,507 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 04:37:13,510 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 04:37:13,512 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 04:37: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 04:37:13,516 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 04:37: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 04:37:13,521 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 04:37:13,524 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 04:37: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 04:37: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 04:37:13,541 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 04:37:13,543 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 04:37:13,545 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 04:37:13,546 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 04:37:13,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:37:13,659 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 04:37:13,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,675 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 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 04:37:13,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,710 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 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 04:37:13,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,744 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 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 04:37:13,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post10=0} Honda state: {ULTIMATE.start_main_#t~post10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:37:13,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,810 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,810 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 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 04:37:13,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,844 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,844 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post11=0} Honda state: {ULTIMATE.start_main_#t~post11=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 04:37:13,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,878 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post12=0} Honda state: {ULTIMATE.start_main_#t~post12=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 04:37:13,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,912 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,912 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post13=0} Honda state: {ULTIMATE.start_main_#t~post13=0} 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 04:37:13,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,946 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,946 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=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 04:37:13,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:13,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:13,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:13,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=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 04:37:14,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,007 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,012 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:37:14,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,072 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,072 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,104 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post14=0} Honda state: {ULTIMATE.start_main_#t~post14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:37:14,165 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post15=0} Honda state: {ULTIMATE.start_main_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:14,191 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:14,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:37:14,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:14,484 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:37:14,487 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:37:14,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:37:14,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:37:14,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:37:14,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:37:14,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:37:14,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:37:14,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:37:14,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 04:37:14,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:37:14,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:37:14,491 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 04:37:14,494 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 04:37:14,496 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 04:37:14,497 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 04:37:14,499 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 04:37:14,501 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 04:37:14,503 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 04:37:14,505 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 04:37:14,507 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 04:37:14,509 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 04:37:14,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:14,513 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 04:37:14,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:14,517 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 04:37:14,539 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 04:37:14,541 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 04:37:14,543 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 04:37:14,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:14,552 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 04:37:14,555 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 04:37:14,558 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 04:37:14,676 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:37:14,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:37:14,685 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 04:37:14,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,692 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 04:37:14,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,695 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 04:37:14,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,697 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 04:37:14,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,713 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 04:37:14,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,723 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 04:37:14,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,725 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 04:37:14,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,728 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 04:37:14,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,731 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 04:37:14,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,733 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 04:37:14,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,736 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 04:37:14,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,739 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 04:37:14,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,742 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 04:37:14,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:14,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:14,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:14,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:14,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:37:14,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:14,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:14,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:14,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:14,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:37:14,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:37:14,773 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:37:14,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:37:14,784 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:37:14,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:37:14,788 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 04:37:14,789 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:37:14,789 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 04:37:14,793 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 04:37:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:14,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:37:14,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:37:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:15,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:37:15,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:37:15,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 04:37:15,133 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:37:15,136 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 04:37:15,137 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-06-22 04:37:15,316 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 04:37:15,316 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 04:37:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 04:37:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-06-22 04:37:15,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. [2020-06-22 04:37:15,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:15,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 11 letters. Loop has 1 letters. [2020-06-22 04:37:15,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:15,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2020-06-22 04:37:15,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:15,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-06-22 04:37:15,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:15,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 12 transitions. [2020-06-22 04:37:15,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:37:15,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:37:15,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-06-22 04:37:15,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:37:15,334 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:37:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-06-22 04:37:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 04:37:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 04:37:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 04:37:15,335 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:37:15,335 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:37:15,335 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:37:15,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-06-22 04:37:15,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:37:15,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:37:15,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:37:15,336 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:37:15,337 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:37:15,337 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L15: 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~post10=|v_ULTIMATE.start_main_#t~post10_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~post14=|v_ULTIMATE.start_main_#t~post14_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_1|, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~post10, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post14, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post15, ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0] 259#L15 [107] L15-->L15-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] 260#L15-2 [91] L15-2-->L20-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_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 268#L20-1 [83] L20-1-->L25-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= (+ v_ULTIMATE.start_main_~x~0_11 1) v_ULTIMATE.start_main_~x~0_10)) 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, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5] 269#L25-1 [93] L25-1-->L30-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_15) (= (+ v_ULTIMATE.start_main_~x~0_15 1) v_ULTIMATE.start_main_~x~0_14)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0] 267#L30-1 [81] L30-1-->L35-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, ULTIMATE.start_main_#t~post9=|v_ULTIMATE.start_main_#t~post9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post9, ULTIMATE.start_main_~x~0] 266#L35-1 [89] L35-1-->L40-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= (+ v_ULTIMATE.start_main_~x~0_23 1) v_ULTIMATE.start_main_~x~0_22)) 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, ULTIMATE.start_main_#t~post11=|v_ULTIMATE.start_main_#t~post11_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post11, ULTIMATE.start_main_~x~0] 265#L40-1 [79] L40-1-->L45-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= (+ v_ULTIMATE.start_main_~x~0_27 1) v_ULTIMATE.start_main_~x~0_26)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_#t~post13=|v_ULTIMATE.start_main_#t~post13_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post13, ULTIMATE.start_main_~x~0] 264#L45-1 [87] L45-1-->L50-1: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_31 1) v_ULTIMATE.start_main_~x~0_30) (< 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, ULTIMATE.start_main_#t~post15=|v_ULTIMATE.start_main_#t~post15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post15] 263#L50-1 [77] L50-1-->L60-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= (+ v_ULTIMATE.start_main_~x~0_35 1) v_ULTIMATE.start_main_~x~0_34)) 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, ULTIMATE.start_main_#t~post17=|v_ULTIMATE.start_main_#t~post17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post17, ULTIMATE.start_main_~x~0] 262#L60-1 [2020-06-22 04:37:15,337 INFO L796 eck$LassoCheckResult]: Loop: 262#L60-1 [76] L60-1-->L60-1: Formula: (and (< v_ULTIMATE.start_main_~z~0_6 100) (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_6)) (< v_ULTIMATE.start_main_~y~0_6 100) (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (* (- 1) v_ULTIMATE.start_main_~x~0_38)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 262#L60-1 [2020-06-22 04:37:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1625529039, now seen corresponding path program 1 times [2020-06-22 04:37:15,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:15,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:15,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:15,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 5 times [2020-06-22 04:37:15,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:15,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:15,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:37:15,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1148207267, now seen corresponding path program 1 times [2020-06-22 04:37:15,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:37:15,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:37:15,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:37:15,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:37:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:37:15,472 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:37:15,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:37:15,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:37:15,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:37:15,472 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:37:15,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:15,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:37:15,473 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:37:15,473 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 04:37:15,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:37:15,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:37:15,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:15,486 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 04:37:15,488 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 04:37:15,490 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 04:37:15,492 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 04:37:15,493 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 04:37:15,495 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 04:37:15,496 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 04:37:15,498 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 04:37:15,499 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 04:37:15,501 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 04:37:15,503 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 04:37:15,505 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 04:37:15,506 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 04:37:15,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:15,509 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 04:37:15,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:37:15,512 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 04:37:15,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 04:37:15,516 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 04:37:15,517 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 04:37:15,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:37:15,589 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:15,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:37:15,593 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:37:15,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:37:15,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:37:15,985 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:37:15,988 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:37:15,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:37:15,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:37:15,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:37:15,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:37:15,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:37:15,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:37:15,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:37:15,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 04:37:15,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:37:15,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:37:15,991 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 04:37:15,993 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 04:37:15,995 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 04:37:15,996 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 04:37:16,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 04:37:16,020 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 04:37:16,021 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 04:37:16,023 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 04:37:16,024 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 04:37:16,026 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 04:37:16,028 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 04:37:16,030 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 04:37:16,032 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 04:37:16,033 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 04:37:16,036 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 04:37:16,037 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 04:37:16,039 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 04:37:16,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 04:37:16,041 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 04:37:16,043 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 04:37:16,044 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 04:37:16,105 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:37:16,105 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:37:16,105 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 04:37:16,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:16,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:16,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:16,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:16,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:16,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:16,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:16,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:16,108 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 04:37:16,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:16,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:16,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:16,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:16,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:16,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:16,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:16,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:16,110 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 04:37:16,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:16,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:37:16,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:16,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:16,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:16,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:37:16,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:37:16,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:37:16,112 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 04:37:16,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:37:16,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:37:16,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:37:16,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:37:16,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:37:16,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:37:16,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:37:16,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:37:16,139 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:37:16,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:37:16,141 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 04:37:16,142 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:37:16,142 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 04:37:16,149 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 04:37:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:37:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:16,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:37:16,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:37:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:37:16,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:37:16,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:37:16,287 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 04:37:16,375 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:37:16,376 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 04:37:16,376 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-06-22 04:37:16,507 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 04:37:16,507 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 04:37:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 04:37:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-06-22 04:37:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 1 letters. [2020-06-22 04:37:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. [2020-06-22 04:37:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-06-22 04:37:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:37:16,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-06-22 04:37:16,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:37:16,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2020-06-22 04:37:16,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:37:16,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:37:16,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:37:16,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:37:16,511 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:37:16,511 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:37:16,511 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:37:16,511 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:37:16,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:37:16,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:37:16,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:37:16,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:37:16 BasicIcfg [2020-06-22 04:37:16,518 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:37:16,518 INFO L168 Benchmark]: Toolchain (without parser) took 4790.10 ms. Allocated memory was 649.6 MB in the beginning and 764.4 MB in the end (delta: 114.8 MB). Free memory was 558.2 MB in the beginning and 437.0 MB in the end (delta: 121.3 MB). Peak memory consumption was 236.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,520 INFO L168 Benchmark]: CDTParser took 0.16 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 04:37:16,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.20 ms. Allocated memory was 649.6 MB in the beginning and 705.2 MB in the end (delta: 55.6 MB). Free memory was 558.2 MB in the beginning and 671.9 MB in the end (delta: -113.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 705.2 MB. Free memory was 671.9 MB in the beginning and 669.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,522 INFO L168 Benchmark]: Boogie Preprocessor took 22.74 ms. Allocated memory is still 705.2 MB. Free memory was 669.7 MB in the beginning and 666.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,523 INFO L168 Benchmark]: RCFGBuilder took 273.59 ms. Allocated memory is still 705.2 MB. Free memory was 666.9 MB in the beginning and 650.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,523 INFO L168 Benchmark]: BlockEncodingV2 took 85.45 ms. Allocated memory is still 705.2 MB. Free memory was 650.0 MB in the beginning and 643.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,524 INFO L168 Benchmark]: TraceAbstraction took 105.71 ms. Allocated memory is still 705.2 MB. Free memory was 643.5 MB in the beginning and 635.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,524 INFO L168 Benchmark]: BuchiAutomizer took 3962.81 ms. Allocated memory was 705.2 MB in the beginning and 764.4 MB in the end (delta: 59.2 MB). Free memory was 635.9 MB in the beginning and 437.0 MB in the end (delta: 199.0 MB). Peak memory consumption was 258.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:37:16,528 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.16 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 295.20 ms. Allocated memory was 649.6 MB in the beginning and 705.2 MB in the end (delta: 55.6 MB). Free memory was 558.2 MB in the beginning and 671.9 MB in the end (delta: -113.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 705.2 MB. Free memory was 671.9 MB in the beginning and 669.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.74 ms. Allocated memory is still 705.2 MB. Free memory was 669.7 MB in the beginning and 666.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 273.59 ms. Allocated memory is still 705.2 MB. Free memory was 666.9 MB in the beginning and 650.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 85.45 ms. Allocated memory is still 705.2 MB. Free memory was 650.0 MB in the beginning and 643.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 105.71 ms. Allocated memory is still 705.2 MB. Free memory was 643.5 MB in the beginning and 635.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3962.81 ms. Allocated memory was 705.2 MB in the beginning and 764.4 MB in the end (delta: 59.2 MB). Free memory was 635.9 MB in the beginning and 437.0 MB in the end (delta: 199.0 MB). Peak memory consumption was 258.2 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.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. 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: 33 SDtfs, 28 SDslu, 0 SDs, 0 SdLazy, 157 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf94 smp100 dnf100 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms VariablesStem: 1 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:37:08.541 ----------------------------------------------- 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 04:37:16.761 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check