YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:11:23,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:11:23,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:11:23,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:11:23,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:11:23,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:11:23,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:11:23,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:11:23,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:11:23,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:11:23,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:11:23,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:11:23,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:11:23,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:11:23,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:11:23,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:11:23,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:11:23,097 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:11:23,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:11:23,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:11:23,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:11:23,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:11:23,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:11:23,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:11:23,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:11:23,106 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:11:23,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:11:23,107 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:11:23,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:11:23,108 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:11:23,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:11:23,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:11:23,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:11:23,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:11:23,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:11:23,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:11:23,111 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:11:23,112 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:11:23,113 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:11:23,113 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:11:23,127 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:11:23,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:11:23,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:11:23,129 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:11:23,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:11:23,129 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:11:23,129 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:11:23,130 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:11:23,130 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:11:23,131 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:23,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:11:23,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:11:23,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:11:23,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:11:23,132 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:11:23,132 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:11:23,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:11:23,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:11:23,132 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:11:23,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:11:23,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:11:23,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:11:23,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:11:23,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:11:23,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:11:23,171 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:11:23,174 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:11:23,175 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:11:23,176 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:11:23,176 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:11:23,275 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/baa26b50b0a9413d995cca0039e64dbe/FLAG5d2a1c69a [2020-06-22 05:11:23,617 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:11:23,618 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:11:23,624 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/baa26b50b0a9413d995cca0039e64dbe/FLAG5d2a1c69a [2020-06-22 05:11:24,046 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/baa26b50b0a9413d995cca0039e64dbe [2020-06-22 05:11:24,058 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:11:24,059 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:11:24,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:11:24,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:11:24,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:11:24,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52698250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:11:24,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:11:24,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:11:24,255 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:11:24,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:11:24,338 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:11:24,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24 WrapperNode [2020-06-22 05:11:24,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:11:24,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:11:24,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:11:24,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:11:24,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:11:24,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:11:24,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:11:24,373 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:11:24,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:11:24,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:11:24,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:11:24,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:11:24,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:11:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:11:24,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:11:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2020-06-22 05:11:24,454 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2020-06-22 05:11:24,573 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:11:24,574 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:11:24,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:11:24 BoogieIcfgContainer [2020-06-22 05:11:24,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:11:24,576 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:11:24,576 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:11:24,578 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:11:24,579 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:11:24" (1/1) ... [2020-06-22 05:11:24,595 INFO L313 BlockEncoder]: Initial Icfg 13 locations, 15 edges [2020-06-22 05:11:24,596 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:11:24,597 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:11:24,597 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:11:24,598 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:11:24,600 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:11:24,600 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:11:24,601 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:11:24,613 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:11:24,620 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:11:24,626 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:11:24,628 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:11:24,637 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:11:24,639 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:11:24,641 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:11:24,641 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:11:24,641 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:11:24,642 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:11:24,642 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 11 edges [2020-06-22 05:11:24,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:11:24 BasicIcfg [2020-06-22 05:11:24,643 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:11:24,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:11:24,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:11:24,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:11:24,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:11:24" (1/4) ... [2020-06-22 05:11:24,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adee021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (2/4) ... [2020-06-22 05:11:24,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adee021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:11:24" (3/4) ... [2020-06-22 05:11:24,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adee021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:11:24" (4/4) ... [2020-06-22 05:11:24,651 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:11:24,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:11:24,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:11:24,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:11:24,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:11:24,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:11:24,713 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:11:24,714 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:11:24,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:11:24,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:11:24,714 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:11:24,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:11:24,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:11:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-06-22 05:11:24,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:11:24,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-06-22 05:11:24,799 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2020-06-22 05:11:24,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:11:24,800 INFO L448 ceAbstractionStarter]: For program point mc91FINAL(lines 8 12) no Hoare annotation was computed. [2020-06-22 05:11:24,800 INFO L451 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: true [2020-06-22 05:11:24,800 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 11) no Hoare annotation was computed. [2020-06-22 05:11:24,801 INFO L451 ceAbstractionStarter]: At program point L11-1(line 11) the Hoare annotation is: true [2020-06-22 05:11:24,801 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 05:11:24,801 INFO L451 ceAbstractionStarter]: At program point mc91ENTRY(lines 8 12) the Hoare annotation is: true [2020-06-22 05:11:24,801 INFO L448 ceAbstractionStarter]: For program point mc91EXIT(lines 8 12) no Hoare annotation was computed. [2020-06-22 05:11:24,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:11:24 BasicIcfg [2020-06-22 05:11:24,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:11:24,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:11:24,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:11:24,809 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:11:24,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:11:24,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:11:24" (1/5) ... [2020-06-22 05:11:24,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5daed8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:11:24,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:11:24" (2/5) ... [2020-06-22 05:11:24,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5daed8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:11:24,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:11:24" (3/5) ... [2020-06-22 05:11:24,812 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5daed8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,812 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:11:24,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:11:24" (4/5) ... [2020-06-22 05:11:24,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5daed8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:11:24, skipping insertion in model container [2020-06-22 05:11:24,813 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:11:24,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:11:24" (5/5) ... [2020-06-22 05:11:24,814 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:11:24,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:11:24,841 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:11:24,841 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:11:24,841 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:11:24,841 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:11:24,841 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:11:24,841 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:11:24,842 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:11:24,842 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:11:24,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 05:11:24,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:11:24,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:24,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:24,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:11:24,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:11:24,873 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:11:24,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 05:11:24,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:11:24,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:24,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:24,875 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:11:24,875 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:11:24,880 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 5#L16true [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 10#mc91ENTRYtrue [2020-06-22 05:11:24,881 INFO L796 eck$LassoCheckResult]: Loop: 10#mc91ENTRYtrue [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 7#L10true [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 9#L11true [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 10#mc91ENTRYtrue [2020-06-22 05:11:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1790, now seen corresponding path program 1 times [2020-06-22 05:11:24,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 1 times [2020-06-22 05:11:24,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:24,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 53350131, now seen corresponding path program 1 times [2020-06-22 05:11:24,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,050 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:25,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:25,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:25,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:25,052 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:11:25,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:25,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:25,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:11:25,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:25,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:25,070 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 05:11:25,085 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 05:11:25,088 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 05:11:25,091 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 05:11:25,093 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 05:11:25,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:25,167 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:25,173 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:11:25,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:25,239 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:11:25,241 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:25,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:25,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:25,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:25,242 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:11:25,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:11:25,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:25,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:25,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:11:25,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:25,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:25,244 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 05:11:25,252 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 05:11:25,255 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 05:11:25,258 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 05:11:25,261 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 05:11:25,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:25,316 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:11:25,317 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 05:11:25,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:25,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:25,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:25,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:25,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:25,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:25,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:25,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:11:25,341 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:11:25,341 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:11:25,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:11:25,343 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:11:25,344 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:11:25,345 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2020-06-22 05:11:25,346 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:11:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:25,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:11:25,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:25,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:11:25,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:25,494 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 05:11:25,517 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:11:25,522 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 05:11:25,523 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-06-22 05:11:25,614 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 31 states and 39 transitions. Complement of second has 16 states. [2020-06-22 05:11:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:11:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-06-22 05:11:25,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 05:11:25,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:25,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 05:11:25,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:25,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 05:11:25,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:25,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2020-06-22 05:11:25,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:11:25,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 27 transitions. [2020-06-22 05:11:25,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 05:11:25,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 05:11:25,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-06-22 05:11:25,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:25,644 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 05:11:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-06-22 05:11:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 05:11:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 05:11:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-06-22 05:11:25,678 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 05:11:25,679 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 05:11:25,679 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:11:25,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-06-22 05:11:25,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:11:25,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:25,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:25,681 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:11:25,681 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:11:25,682 INFO L794 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 101#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 105#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 112#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 100#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 111#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 107#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 108#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 106#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 97#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 110#mc91ENTRY [2020-06-22 05:11:25,682 INFO L796 eck$LassoCheckResult]: Loop: 110#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 114#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 98#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 110#mc91ENTRY [2020-06-22 05:11:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 1 times [2020-06-22 05:11:25,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 2 times [2020-06-22 05:11:25,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:25,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -68906676, now seen corresponding path program 2 times [2020-06-22 05:11:25,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:25,754 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:25,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:25,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:25,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:25,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:11:25,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:25,755 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:25,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:11:25,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:25,755 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:25,757 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 05:11:25,759 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 05:11:25,761 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 05:11:25,764 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 05:11:25,770 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 05:11:25,798 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:25,798 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:25,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:25,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:25,807 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_~n=0} Honda state: {mc91_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:25,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:25,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:25,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:25,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:25,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:25,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:25,899 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:25,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:11:25,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:25,964 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:11:25,967 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:25,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:25,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:25,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:25,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:11:25,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:11:25,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:25,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:25,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:11:25,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:25,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:25,970 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 05:11:25,974 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 05:11:25,976 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 05:11:25,978 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 05:11:25,985 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 05:11:26,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:26,037 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:11:26,037 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 05:11:26,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:26,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:26,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:26,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:26,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:26,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:26,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:26,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:26,043 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 05:11:26,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:26,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:26,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:26,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:26,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:26,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:26,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:26,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:26,046 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 05:11:26,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:26,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:26,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:26,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:26,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:26,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:26,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:26,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:26,050 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 05:11:26,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:26,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:26,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:26,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:26,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:26,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:26,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:26,057 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:11:26,061 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:11:26,061 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:11:26,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:11:26,062 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:11:26,062 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:11:26,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2020-06-22 05:11:26,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:11:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:11:26,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:26,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:11:26,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:26,212 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 05:11:26,264 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:11:26,265 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 05:11:26,265 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-06-22 05:11:26,398 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 17 states. [2020-06-22 05:11:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:11:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-06-22 05:11:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-22 05:11:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-22 05:11:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 05:11:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:26,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2020-06-22 05:11:26,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 05:11:26,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 44 transitions. [2020-06-22 05:11:26,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 05:11:26,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 05:11:26,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2020-06-22 05:11:26,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:26,410 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-06-22 05:11:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2020-06-22 05:11:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-06-22 05:11:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 05:11:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-06-22 05:11:26,416 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-06-22 05:11:26,416 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-06-22 05:11:26,416 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:11:26,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-06-22 05:11:26,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:11:26,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:26,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:26,418 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:11:26,419 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2020-06-22 05:11:26,419 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 250#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 251#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 257#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 243#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 256#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 258#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 260#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 261#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 246#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY [2020-06-22 05:11:26,420 INFO L796 eck$LassoCheckResult]: Loop: 255#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 244#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 265#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 244#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 265#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 266#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 264#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 248#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 242#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 252#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 253#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 262#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 241#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 247#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 263#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 242#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 255#mc91ENTRY [2020-06-22 05:11:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 3 times [2020-06-22 05:11:26,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:26,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:26,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1040176321, now seen corresponding path program 1 times [2020-06-22 05:11:26,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:26,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1837633157, now seen corresponding path program 1 times [2020-06-22 05:11:26,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-06-22 05:11:26,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:11:26,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:11:26,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:26,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:11:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-06-22 05:11:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:11:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 05:11:26,834 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:26,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:26,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:26,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:26,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:11:26,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:26,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:26,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:26,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:11:26,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:26,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:26,836 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 05:11:26,847 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 05:11:26,849 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 05:11:26,851 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 05:11:26,853 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 05:11:26,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:26,881 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:26,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:26,884 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:26,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:11:26,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:26,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:11:26,944 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:26,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:26,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:26,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:26,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:11:26,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:11:26,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:26,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:26,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:11:26,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:26,945 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:26,946 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 05:11:26,953 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 05:11:26,955 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 05:11:26,957 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 05:11:26,958 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 05:11:26,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:26,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:11:26,981 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 05:11:26,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:26,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:26,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:26,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:26,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:26,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:26,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:26,988 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:11:26,990 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:11:26,990 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:11:26,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:11:26,991 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:11:26,991 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:11:26,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2020-06-22 05:11:26,992 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:11:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:27,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:11:27,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:27,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 05:11:27,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 05:11:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:27,398 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:11:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:27,426 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:11:27,426 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization [2020-06-22 05:11:27,427 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates [2020-06-22 05:11:27,427 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-06-22 05:11:29,510 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 5965 states and 8865 transitions. Complement of second has 4264 states. [2020-06-22 05:11:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 2 stem states 25 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:11:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2020-06-22 05:11:29,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 19 letters. [2020-06-22 05:11:29,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:29,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 29 letters. Loop has 19 letters. [2020-06-22 05:11:29,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:29,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 38 letters. [2020-06-22 05:11:29,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:29,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5965 states and 8865 transitions. [2020-06-22 05:11:29,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2020-06-22 05:11:29,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5965 states to 812 states and 1262 transitions. [2020-06-22 05:11:29,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2020-06-22 05:11:29,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2020-06-22 05:11:29,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 812 states and 1262 transitions. [2020-06-22 05:11:29,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:29,677 INFO L706 BuchiCegarLoop]: Abstraction has 812 states and 1262 transitions. [2020-06-22 05:11:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states and 1262 transitions. [2020-06-22 05:11:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 691. [2020-06-22 05:11:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-06-22 05:11:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 981 transitions. [2020-06-22 05:11:29,747 INFO L729 BuchiCegarLoop]: Abstraction has 691 states and 981 transitions. [2020-06-22 05:11:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:11:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:11:29,752 INFO L87 Difference]: Start difference. First operand 691 states and 981 transitions. Second operand 8 states. [2020-06-22 05:11:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:11:29,989 INFO L93 Difference]: Finished difference Result 700 states and 939 transitions. [2020-06-22 05:11:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:11:29,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 939 transitions. [2020-06-22 05:11:30,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 [2020-06-22 05:11:30,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 550 states and 744 transitions. [2020-06-22 05:11:30,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2020-06-22 05:11:30,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2020-06-22 05:11:30,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 744 transitions. [2020-06-22 05:11:30,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:30,016 INFO L706 BuchiCegarLoop]: Abstraction has 550 states and 744 transitions. [2020-06-22 05:11:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 744 transitions. [2020-06-22 05:11:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 468. [2020-06-22 05:11:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-06-22 05:11:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 612 transitions. [2020-06-22 05:11:30,037 INFO L729 BuchiCegarLoop]: Abstraction has 468 states and 612 transitions. [2020-06-22 05:11:30,038 INFO L609 BuchiCegarLoop]: Abstraction has 468 states and 612 transitions. [2020-06-22 05:11:30,038 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:11:30,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 612 transitions. [2020-06-22 05:11:30,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 [2020-06-22 05:11:30,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:30,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:30,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 05:11:30,044 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:11:30,045 INFO L794 eck$LassoCheckResult]: Stem: 12173#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 12174#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 12175#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12254#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12249#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12250#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12253#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 12330#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12329#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 12189#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 12190#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12565#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12222#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12245#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12243#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12218#L11 [2020-06-22 05:11:30,045 INFO L796 eck$LassoCheckResult]: Loop: 12218#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 12247#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 12243#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 12218#L11 [2020-06-22 05:11:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1794805415, now seen corresponding path program 4 times [2020-06-22 05:11:30,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:30,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:30,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:30,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:30,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:11:30,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:11:30,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 05:11:30,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:11:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 59402, now seen corresponding path program 3 times [2020-06-22 05:11:30,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:30,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:30,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:30,141 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:30,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:30,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:30,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:30,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:11:30,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:30,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:30,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:30,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:11:30,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:30,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:30,144 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 05:11:30,146 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 05:11:30,154 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 05:11:30,156 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 05:11:30,188 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:30,188 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:30,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:30,197 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:30,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:30,206 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:30,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:30,248 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 05:11:30,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:11:30,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:42,335 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 05:11:42,339 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:42,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:42,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:42,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:42,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:11:42,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:11:42,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:42,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:42,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:11:42,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:42,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:42,341 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 05:11:42,343 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 05:11:42,345 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 05:11:42,346 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 05:11:42,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:42,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:11:42,382 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 05:11:42,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:42,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:42,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:42,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:42,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:42,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:42,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:42,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:42,385 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 05:11:42,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:42,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:42,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:42,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:42,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:42,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:42,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:42,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:42,388 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 05:11:42,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:42,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:42,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:42,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:42,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:42,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:42,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:42,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:42,390 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 05:11:42,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:42,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:42,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:42,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:42,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:42,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:42,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:42,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:11:42,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:11:42,402 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:11:42,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:11:42,402 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:11:42,403 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:11:42,403 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2020-06-22 05:11:42,403 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:11:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:42,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:11:42,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:42,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:11:42,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:42,611 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 05:11:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:42,645 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:11:42,645 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:11:42,645 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 05:11:42,646 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 468 states and 612 transitions. cyclomatic complexity: 154 Second operand 5 states. [2020-06-22 05:11:42,765 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 468 states and 612 transitions. cyclomatic complexity: 154. Second operand 5 states. Result 726 states and 923 transitions. Complement of second has 31 states. [2020-06-22 05:11:42,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:11:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-06-22 05:11:42,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-06-22 05:11:42,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:42,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 18 letters. Loop has 3 letters. [2020-06-22 05:11:42,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:42,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2020-06-22 05:11:42,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:42,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 726 states and 923 transitions. [2020-06-22 05:11:42,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 77 [2020-06-22 05:11:42,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 726 states to 494 states and 663 transitions. [2020-06-22 05:11:42,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2020-06-22 05:11:42,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2020-06-22 05:11:42,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 663 transitions. [2020-06-22 05:11:42,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:42,788 INFO L706 BuchiCegarLoop]: Abstraction has 494 states and 663 transitions. [2020-06-22 05:11:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 663 transitions. [2020-06-22 05:11:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 479. [2020-06-22 05:11:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-06-22 05:11:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 640 transitions. [2020-06-22 05:11:42,803 INFO L729 BuchiCegarLoop]: Abstraction has 479 states and 640 transitions. [2020-06-22 05:11:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:11:42,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:11:42,804 INFO L87 Difference]: Start difference. First operand 479 states and 640 transitions. Second operand 8 states. [2020-06-22 05:11:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:11:42,933 INFO L93 Difference]: Finished difference Result 551 states and 758 transitions. [2020-06-22 05:11:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:11:42,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 758 transitions. [2020-06-22 05:11:42,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2020-06-22 05:11:42,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 547 states and 749 transitions. [2020-06-22 05:11:42,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2020-06-22 05:11:42,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2020-06-22 05:11:42,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 749 transitions. [2020-06-22 05:11:42,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:42,952 INFO L706 BuchiCegarLoop]: Abstraction has 547 states and 749 transitions. [2020-06-22 05:11:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 749 transitions. [2020-06-22 05:11:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 479. [2020-06-22 05:11:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-06-22 05:11:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 633 transitions. [2020-06-22 05:11:42,968 INFO L729 BuchiCegarLoop]: Abstraction has 479 states and 633 transitions. [2020-06-22 05:11:42,968 INFO L609 BuchiCegarLoop]: Abstraction has 479 states and 633 transitions. [2020-06-22 05:11:42,968 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:11:42,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states and 633 transitions. [2020-06-22 05:11:42,973 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2020-06-22 05:11:42,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:42,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:42,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 3, 3, 3, 3, 3, 3, 1, 1] [2020-06-22 05:11:42,974 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 05:11:42,975 INFO L794 eck$LassoCheckResult]: Stem: 14539#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 14540#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 14541#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14589#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14658#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14664#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14876#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14874#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14872#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14668#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14671#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14868#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14870#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14871#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14875#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14873#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14869#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14686#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14714#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14932#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14934#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14554#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14937#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14936#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14933#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14928#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14931#mc91ENTRY [2020-06-22 05:11:42,975 INFO L796 eck$LassoCheckResult]: Loop: 14931#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14953#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 14935#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 14554#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 14937#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 14936#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14933#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 14929#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 14931#mc91ENTRY [2020-06-22 05:11:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1239756499, now seen corresponding path program 5 times [2020-06-22 05:11:42,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:42,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:42,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:42,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash 725061960, now seen corresponding path program 1 times [2020-06-22 05:11:42,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:42,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1406022118, now seen corresponding path program 6 times [2020-06-22 05:11:43,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:43,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:11:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:43,121 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:43,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:43,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:43,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:43,122 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:11:43,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:43,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:43,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:43,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:11:43,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:43,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:43,123 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 05:11:43,126 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 05:11:43,128 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 05:11:43,134 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 05:11:43,136 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 05:11:43,173 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:43,174 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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) [2020-06-22 05:11:43,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:43,182 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:11:43,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:43,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 05:11:43,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:43,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:43,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:11:43,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/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 05:11:43,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:11:43,287 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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 05:11:43,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:11:43,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:11:43,344 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:11:43,369 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:11:43,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:11:43,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:11:43,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:11:43,370 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:11:43,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:11:43,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:11:43,370 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:11:43,370 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:11:43,370 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:11:43,370 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:11:43,371 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 05:11:43,374 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 05:11:43,376 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 05:11:43,384 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 05:11:43,386 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 05:11:43,416 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:11:43,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:11:43,417 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 05:11:43,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:43,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:43,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:43,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:43,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:43,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:43,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:43,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:43,420 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 05:11:43,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:43,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:43,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:43,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:43,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:43,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:43,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:43,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:11:43,422 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 05:11:43,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:11:43,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:11:43,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:11:43,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:11:43,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:11:43,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:11:43,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:11:43,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:11:43,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:11:43,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:11:43,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:11:43,429 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:11:43,429 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:11:43,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 201 Supporting invariants [] [2020-06-22 05:11:43,429 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:11:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:43,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 05:11:43,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:43,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:11:43,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:11:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:43,750 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:11:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:11:43,762 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:11:43,762 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 05:11:43,762 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates [2020-06-22 05:11:43,762 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166 Second operand 9 states. [2020-06-22 05:11:44,385 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166. Second operand 9 states. Result 7295 states and 10236 transitions. Complement of second has 174 states. [2020-06-22 05:11:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:11:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-06-22 05:11:44,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 26 letters. Loop has 8 letters. [2020-06-22 05:11:44,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:44,388 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 05:11:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:44,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 05:11:44,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:44,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:11:44,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:11:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:11:44,602 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2020-06-22 05:11:44,603 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166 Second operand 9 states. [2020-06-22 05:11:45,120 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 479 states and 633 transitions. cyclomatic complexity: 166. Second operand 9 states. Result 1403 states and 1718 transitions. Complement of second has 95 states. [2020-06-22 05:11:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 05:11:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:11:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2020-06-22 05:11:45,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 8 letters. [2020-06-22 05:11:45,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:45,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 34 letters. Loop has 8 letters. [2020-06-22 05:11:45,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:45,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 16 letters. [2020-06-22 05:11:45,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:11:45,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1403 states and 1718 transitions. [2020-06-22 05:11:45,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-06-22 05:11:45,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1403 states to 508 states and 694 transitions. [2020-06-22 05:11:45,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-06-22 05:11:45,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2020-06-22 05:11:45,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 508 states and 694 transitions. [2020-06-22 05:11:45,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:11:45,145 INFO L706 BuchiCegarLoop]: Abstraction has 508 states and 694 transitions. [2020-06-22 05:11:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 694 transitions. [2020-06-22 05:11:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 452. [2020-06-22 05:11:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-06-22 05:11:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 590 transitions. [2020-06-22 05:11:45,160 INFO L729 BuchiCegarLoop]: Abstraction has 452 states and 590 transitions. [2020-06-22 05:11:45,160 INFO L609 BuchiCegarLoop]: Abstraction has 452 states and 590 transitions. [2020-06-22 05:11:45,160 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 05:11:45,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 452 states and 590 transitions. [2020-06-22 05:11:45,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-06-22 05:11:45,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:11:45,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:11:45,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [12, 8, 7, 6, 5, 5, 5, 3, 3, 1, 1] [2020-06-22 05:11:45,165 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 4, 3, 3, 3, 2, 2] [2020-06-22 05:11:45,166 INFO L794 eck$LassoCheckResult]: Stem: 24247#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L16: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 24248#L16 [23] L16-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_1| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_1|} AuxVars[] AssignedVars[mc91_#in~n]< 24249#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24286#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24282#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24283#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24285#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24281#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24284#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24351#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24350#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24349#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24303#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24302#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24304#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24441#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24437#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24436#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24435#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24430#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24431#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24439#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24461#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24463#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24464#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24477#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24474#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24475#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24486#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24473#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24476#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24488#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24487#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24472#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24385#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24393#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24388#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24387#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24467#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24468#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24484#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24482#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24480#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24481#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24544#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24489#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24478#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24448#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24471#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24470#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24341#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24457#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24515#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24518#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24519#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24534#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24531#L11 [2020-06-22 05:11:45,167 INFO L796 eck$LassoCheckResult]: Loop: 24531#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24532#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24539#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24530#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24532#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24539#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24530#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24533#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24541#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24537#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24529#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24526#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24528#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24622#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24619#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24524#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24527#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24543#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24542#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24252#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24536#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24645#L10 [27] L10-->mc91FINAL: Formula: (and (= |v_mc91_#res_1| (+ v_mc91_~n_2 (- 10))) (< 100 v_mc91_~n_2)) InVars {mc91_~n=v_mc91_~n_2} OutVars{mc91_#res=|v_mc91_#res_1|, mc91_~n=v_mc91_~n_2} AuxVars[] AssignedVars[mc91_#res] 24633#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24535#mc91EXIT >[36] mc91EXIT-->L11-2: AOR: Formula: (= |v_mc91_#t~ret1_4| |v_mc91_#resOutParam_3|) InVars {mc91_#res=|v_mc91_#resOutParam_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_4|} AuxVars[] AssignedVars[mc91_#t~ret1] LVA: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n] 24506#L11-2 [25] L11-2-->mc91FINAL: Formula: (= |v_mc91_#res_2| |v_mc91_#t~ret1_3|) InVars {mc91_#t~ret1=|v_mc91_#t~ret1_3|} OutVars{mc91_#t~ret1=|v_mc91_#t~ret1_2|, mc91_#t~ret0=|v_mc91_#t~ret0_3|, mc91_#res=|v_mc91_#res_2|} AuxVars[] AssignedVars[mc91_#t~ret1, mc91_#t~ret0, mc91_#res] 24540#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24538#mc91EXIT >[35] mc91EXIT-->L11-1: AOR: Formula: (= |v_mc91_#t~ret0_4| |v_mc91_#resOutParam_2|) InVars {mc91_#res=|v_mc91_#resOutParam_2|} OutVars{mc91_#t~ret0=|v_mc91_#t~ret0_4|} AuxVars[] AssignedVars[mc91_#t~ret0] LVA: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n] 24293#L11-1 [29] L11-1-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_3| |v_mc91_#t~ret0_5|) InVars {mc91_#t~ret0=|v_mc91_#t~ret0_5|} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_3|} AuxVars[] AssignedVars[mc91_#in~n]< 24258#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24348#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24517#L11 [30] L11-->mc91ENTRY: Formula: (= |v_mc91_#in~nInParam_2| (+ v_mc91_~n_5 11)) InVars {mc91_~n=v_mc91_~n_5} OutVars{mc91_#in~n=|v_mc91_#in~nInParam_2|} AuxVars[] AssignedVars[mc91_#in~n]< 24519#mc91ENTRY [24] mc91ENTRY-->L10: Formula: (= v_mc91_~n_1 |v_mc91_#in~n_1|) InVars {mc91_#in~n=|v_mc91_#in~n_1|} OutVars{mc91_#in~n=|v_mc91_#in~n_1|, mc91_~n=v_mc91_~n_1} AuxVars[] AssignedVars[mc91_~n] 24534#L10 [37] L10-->L11: Formula: (>= 100 v_mc91_~n_3) InVars {mc91_~n=v_mc91_~n_3} OutVars{mc91_~n=v_mc91_~n_3} AuxVars[] AssignedVars[] 24531#L11 [2020-06-22 05:11:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash 521030405, now seen corresponding path program 2 times [2020-06-22 05:11:45,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:45,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-06-22 05:11:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:11:45,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 05:11:45,252 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:11:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:11:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash -672784141, now seen corresponding path program 2 times [2020-06-22 05:11:45,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:11:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:11:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:45,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:11:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:11:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:11:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-06-22 05:11:45,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:11:45,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 05:11:45,335 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:11:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 05:11:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 05:11:45,336 INFO L87 Difference]: Start difference. First operand 452 states and 590 transitions. cyclomatic complexity: 148 Second operand 9 states. [2020-06-22 05:11:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:11:45,510 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2020-06-22 05:11:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 05:11:45,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 75 transitions. [2020-06-22 05:11:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:11:45,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2020-06-22 05:11:45,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:11:45,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:11:45,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:11:45,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:11:45,513 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:11:45,513 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:11:45,513 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:11:45,513 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 05:11:45,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:11:45,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:11:45,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:11:45,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:11:45 BasicIcfg [2020-06-22 05:11:45,522 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:11:45,522 INFO L168 Benchmark]: Toolchain (without parser) took 21464.12 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 385.9 MB). Free memory was 565.2 MB in the beginning and 862.6 MB in the end (delta: -297.4 MB). Peak memory consumption was 88.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,524 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:11:45,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.18 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 565.2 MB in the beginning and 641.5 MB in the end (delta: -76.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.41 ms. Allocated memory is still 673.7 MB. Free memory was 641.5 MB in the beginning and 638.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,526 INFO L168 Benchmark]: Boogie Preprocessor took 15.51 ms. Allocated memory is still 673.7 MB. Free memory is still 638.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:11:45,526 INFO L168 Benchmark]: RCFGBuilder took 187.10 ms. Allocated memory is still 673.7 MB. Free memory was 638.8 MB in the beginning and 622.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,527 INFO L168 Benchmark]: BlockEncodingV2 took 67.08 ms. Allocated memory is still 673.7 MB. Free memory was 622.8 MB in the beginning and 617.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,527 INFO L168 Benchmark]: TraceAbstraction took 161.02 ms. Allocated memory is still 673.7 MB. Free memory was 617.7 MB in the beginning and 606.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,528 INFO L168 Benchmark]: BuchiAutomizer took 20716.76 ms. Allocated memory was 673.7 MB in the beginning and 1.0 GB in the end (delta: 361.8 MB). Free memory was 606.9 MB in the beginning and 862.6 MB in the end (delta: -255.7 MB). Peak memory consumption was 106.0 MB. Max. memory is 50.3 GB. [2020-06-22 05:11:45,531 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 15 edges - StatisticsResult: Encoded RCFG 9 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 279.18 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 565.2 MB in the beginning and 641.5 MB in the end (delta: -76.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.41 ms. Allocated memory is still 673.7 MB. Free memory was 641.5 MB in the beginning and 638.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 15.51 ms. Allocated memory is still 673.7 MB. Free memory is still 638.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * RCFGBuilder took 187.10 ms. Allocated memory is still 673.7 MB. Free memory was 638.8 MB in the beginning and 622.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 67.08 ms. Allocated memory is still 673.7 MB. Free memory was 622.8 MB in the beginning and 617.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 161.02 ms. Allocated memory is still 673.7 MB. Free memory was 617.7 MB in the beginning and 606.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 20716.76 ms. Allocated memory was 673.7 MB in the beginning and 1.0 GB in the end (delta: 361.8 MB). Free memory was 606.9 MB in the beginning and 862.6 MB in the end (delta: -255.7 MB). Peak memory consumption was 106.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 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=9occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -2 * \old(n) + 211 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * \old(n) + 211 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) + 90 and consists of 28 locations. One nondeterministic module has affine ranking function -2 * n + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * \old(n) + 201 and consists of 11 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.6s and 7 iterations. TraceHistogramMax:12. Analysis of lassos took 14.4s. Construction of modules took 0.8s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 348 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 479 states and ocurred in iteration 4. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/22 HoareTripleCheckerStatistics: 123 SDtfs, 220 SDslu, 208 SDs, 0 SdLazy, 769 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf111 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:11:20.758 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:11:45.769 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check