/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:17:21,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:17:21,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:17:21,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:17:21,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:17:21,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:17:21,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:17:21,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:17:21,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:17:21,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:17:21,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:17:21,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:17:21,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:17:21,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:17:21,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:17:21,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:17:21,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:17:21,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:17:21,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:17:21,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:17:21,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:17:21,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:17:21,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:17:21,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:17:21,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:17:21,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:17:21,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:17:21,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:17:21,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:17:21,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:17:21,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:17:21,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:17:21,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:17:21,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:17:21,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:17:21,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:17:21,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:17:21,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:17:21,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:17:21,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:17:21,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:17:21,707 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:17:21,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:17:21,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:17:21,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:17:21,722 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:17:21,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:17:21,723 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:17:21,723 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:17:21,723 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:17:21,723 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:17:21,723 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:17:21,724 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:17:21,724 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:17:21,724 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:17:21,724 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:17:21,724 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:21,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:17:21,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:17:21,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:17:21,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:17:21,725 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:17:21,725 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:17:21,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:17:21,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:17:21,726 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:17:21,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:17:21,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:17:21,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:17:21,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:17:21,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:17:21,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:17:21,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:17:21,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:17:21,913 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:17:21,913 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:17:21,914 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:17:21,981 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_eeVyE7/tmp/04e8b9fac6cd49e391b803f62bfb0256/FLAG817cf395b [2020-07-01 13:17:22,334 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:17:22,335 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:17:22,342 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_eeVyE7/tmp/04e8b9fac6cd49e391b803f62bfb0256/FLAG817cf395b [2020-07-01 13:17:22,728 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_eeVyE7/tmp/04e8b9fac6cd49e391b803f62bfb0256 [2020-07-01 13:17:22,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:17:22,741 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:17:22,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:17:22,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:17:22,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:17:22,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:17:22" (1/1) ... [2020-07-01 13:17:22,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c56baba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:22, skipping insertion in model container [2020-07-01 13:17:22,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:17:22" (1/1) ... [2020-07-01 13:17:22,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:17:22,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:17:22,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:17:22,983 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:17:22,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:17:23,012 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:17:23,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23 WrapperNode [2020-07-01 13:17:23,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:17:23,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:17:23,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:17:23,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:17:23,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:17:23,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:17:23,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:17:23,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:17:23,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:17:23,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:17:23,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:17:23,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:17:23,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (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-07-01 13:17:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:17:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:17:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2020-07-01 13:17:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2020-07-01 13:17:23,266 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:17:23,266 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-01 13:17:23,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23 BoogieIcfgContainer [2020-07-01 13:17:23,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:17:23,271 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:17:23,271 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:17:23,273 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:17:23,274 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,288 INFO L313 BlockEncoder]: Initial Icfg 13 locations, 15 edges [2020-07-01 13:17:23,290 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:17:23,290 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:17:23,291 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:17:23,291 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:17:23,293 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:17:23,294 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:17:23,294 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:17:23,307 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:17:23,314 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 13:17:23,318 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:17:23,320 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:17:23,331 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 13:17:23,333 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 13:17:23,335 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:17:23,335 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:17:23,335 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:17:23,335 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:17:23,336 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 11 edges [2020-07-01 13:17:23,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23 BasicIcfg [2020-07-01 13:17:23,336 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:17:23,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:17:23,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:17:23,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:17:23,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:17:22" (1/4) ... [2020-07-01 13:17:23,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260ad183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (2/4) ... [2020-07-01 13:17:23,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260ad183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (3/4) ... [2020-07-01 13:17:23,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260ad183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23" (4/4) ... [2020-07-01 13:17:23,345 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:17:23,355 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:17:23,362 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 13:17:23,376 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 13:17:23,400 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:17:23,400 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:17:23,400 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:17:23,400 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:17:23,400 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:17:23,400 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:17:23,401 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:17:23,401 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:17:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-07-01 13:17:23,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:17:23,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-07-01 13:17:23,492 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-01 13:17:23,493 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:17:23,493 INFO L268 CegarLoopResult]: For program point mc91FINAL(lines 8 12) no Hoare annotation was computed. [2020-07-01 13:17:23,493 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-01 13:17:23,493 INFO L268 CegarLoopResult]: For program point L10(lines 10 11) no Hoare annotation was computed. [2020-07-01 13:17:23,494 INFO L271 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-07-01 13:17:23,494 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 13:17:23,494 INFO L271 CegarLoopResult]: At program point mc91ENTRY(lines 8 12) the Hoare annotation is: true [2020-07-01 13:17:23,494 INFO L268 CegarLoopResult]: For program point mc91EXIT(lines 8 12) no Hoare annotation was computed. [2020-07-01 13:17:23,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:23 BasicIcfg [2020-07-01 13:17:23,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:17:23,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:17:23,499 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:17:23,503 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:17:23,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:23,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:17:22" (1/5) ... [2020-07-01 13:17:23,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a3c1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:23,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (2/5) ... [2020-07-01 13:17:23,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a3c1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:23,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (3/5) ... [2020-07-01 13:17:23,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a3c1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:23,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23" (4/5) ... [2020-07-01 13:17:23,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a3c1f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:23,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:23" (5/5) ... [2020-07-01 13:17:23,509 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:17:23,538 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:17:23,538 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:17:23,538 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:17:23,538 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:17:23,538 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:17:23,539 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:17:23,539 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:17:23,539 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:17:23,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 13:17:23,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:17:23,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:23,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:23,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:17:23,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:17:23,570 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:17:23,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 13:17:23,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:17:23,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:23,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:23,572 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:17:23,572 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:17:23,577 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-07-01 13:17:23,578 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-07-01 13:17:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1790, now seen corresponding path program 1 times [2020-07-01 13:17:23,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:23,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302458026] [2020-07-01 13:17:23,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,658 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 1 times [2020-07-01 13:17:23,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:23,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419882015] [2020-07-01 13:17:23,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,678 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash 53350131, now seen corresponding path program 1 times [2020-07-01 13:17:23,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:23,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312744821] [2020-07-01 13:17:23,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:23,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:23,773 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:23,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:23,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:23,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:23,774 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:17:23,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:23,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:23,775 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:23,775 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:17:23,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:23,775 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:23,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:23,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:23,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:23,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:23,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:23,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:23,891 INFO L404 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-07-01 13:17:23,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:23,898 INFO L160 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-07-01 13:17:23,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:17:23,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:24,996 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:17:24,999 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:25,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:25,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:25,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:25,009 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:17:25,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:25,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:25,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:17:25,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:25,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:25,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,071 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:25,077 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,081 INFO L120 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-07-01 13:17:25,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:25,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:25,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:25,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:25,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:25,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:25,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:25,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:17:25,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:17:25,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:17:25,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:17:25,106 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:17:25,106 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2020-07-01 13:17:25,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:17:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:17:25,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:17:25,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:25,277 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 13:17:25,283 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-07-01 13:17:25,284 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-07-01 13:17:25,391 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-07-01 13:17:25,392 INFO L141 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-07-01 13:17:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 13:17:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-01 13:17:25,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-01 13:17:25,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:25,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-01 13:17:25,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:25,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 13:17:25,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:25,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2020-07-01 13:17:25,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:17:25,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 27 transitions. [2020-07-01 13:17:25,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 13:17:25,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-01 13:17:25,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-07-01 13:17:25,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:17:25,422 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-01 13:17:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-07-01 13:17:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-01 13:17:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:17:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-01 13:17:25,458 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-01 13:17:25,458 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-01 13:17:25,458 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:17:25,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-01 13:17:25,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:17:25,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:25,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:25,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:25,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:17:25,461 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-07-01 13:17:25,462 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-07-01 13:17:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 1 times [2020-07-01 13:17:25,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:25,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810418879] [2020-07-01 13:17:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash 54032, now seen corresponding path program 2 times [2020-07-01 13:17:25,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:25,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593788513] [2020-07-01 13:17:25,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -68906676, now seen corresponding path program 2 times [2020-07-01 13:17:25,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:25,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191098319] [2020-07-01 13:17:25,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:25,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:25,540 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:25,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:25,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:25,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:25,541 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:17:25,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:25,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:25,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:25,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 13:17:25,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:25,542 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:25,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,600 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:25,600 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:25,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:25,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:25,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:17:25,612 INFO L440 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 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-07-01 13:17:25,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:25,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:25,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:17:25,652 INFO L440 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 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-07-01 13:17:25,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:25,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:25,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:17:25,689 INFO L440 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:25,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:25,723 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 13:17:25,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:17:25,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:25,797 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:17:25,799 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:25,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:25,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:25,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:25,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:17:25,800 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:25,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:25,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 13:17:25,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:25,801 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:25,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:25,861 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:25,861 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,865 INFO L120 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-07-01 13:17:25,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:25,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:25,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:25,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:25,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:25,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:25,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:25,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,904 INFO L120 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-07-01 13:17:25,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:25,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:25,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:25,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:25,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:25,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:25,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:25,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,944 INFO L120 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-07-01 13:17:25,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:25,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:25,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:25,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:25,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:25,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:25,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:25,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 13:17:25,985 INFO L120 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-07-01 13:17:25,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:25,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:25,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:25,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:25,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:25,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:25,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:25,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:17:25,996 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:17:25,997 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:26,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:17:26,010 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:17:26,010 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:17:26,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2020-07-01 13:17:26,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:17:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:17:26,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:17:26,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:26,214 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 13:17:26,214 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-07-01 13:17:26,215 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-01 13:17:26,350 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-07-01 13:17:26,351 INFO L141 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-07-01 13:17:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 13:17:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-01 13:17:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-01 13:17:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-01 13:17:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-01 13:17:26,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:26,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2020-07-01 13:17:26,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:17:26,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 44 transitions. [2020-07-01 13:17:26,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-01 13:17:26,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-01 13:17:26,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2020-07-01 13:17:26,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:17:26,363 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-01 13:17:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2020-07-01 13:17:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-07-01 13:17:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:17:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-01 13:17:26,369 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-01 13:17:26,369 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-01 13:17:26,369 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 13:17:26,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-01 13:17:26,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 13:17:26,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:26,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:26,372 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:26,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2020-07-01 13:17:26,372 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-07-01 13:17:26,373 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-07-01 13:17:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1299401541, now seen corresponding path program 3 times [2020-07-01 13:17:26,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:26,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413471726] [2020-07-01 13:17:26,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:26,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1040176321, now seen corresponding path program 1 times [2020-07-01 13:17:26,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:26,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039740697] [2020-07-01 13:17:26,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:26,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1837633157, now seen corresponding path program 1 times [2020-07-01 13:17:26,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:26,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292199899] [2020-07-01 13:17:26,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-01 13:17:26,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292199899] [2020-07-01 13:17:26,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745726671] [2020-07-01 13:17:26,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:26,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:17:26,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-01 13:17:26,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:17:26,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-01 13:17:26,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553825399] [2020-07-01 13:17:26,888 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:26,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:26,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:26,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:26,889 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:17:26,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:26,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:26,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:26,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 13:17:26,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:26,889 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:26,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:26,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:26,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:26,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:26,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:26,934 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:26,935 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-01 13:17:26,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:26,939 INFO L160 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-07-01 13:17:26,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:17:26,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:26,981 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:17:27,010 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:27,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:27,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:27,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:27,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:17:27,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:27,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:27,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:27,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 13:17:27,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:27,011 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:27,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:27,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:27,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:27,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:27,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:27,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:27,057 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:27,061 INFO L120 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-07-01 13:17:27,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:27,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:27,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:27,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:27,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:27,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:27,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:27,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:17:27,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:17:27,071 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:27,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:17:27,075 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:17:27,075 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:17:27,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2020-07-01 13:17:27,105 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:17:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:27,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:17:27,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:27,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 13:17:27,186 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:17:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:27,426 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:17:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:27,450 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:17:27,450 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-07-01 13:17:27,451 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 9 loop predicates [2020-07-01 13:17:27,451 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-07-01 13:17:30,372 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 11 states. Result 10065 states and 19991 transitions. Complement of second has 7557 states. [2020-07-01 13:17:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 2 stem states 29 non-accepting loop states 1 accepting loop states [2020-07-01 13:17:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 13:17:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2020-07-01 13:17:30,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 74 transitions. Stem has 10 letters. Loop has 19 letters. [2020-07-01 13:17:30,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:30,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 74 transitions. Stem has 29 letters. Loop has 19 letters. [2020-07-01 13:17:30,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:30,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 74 transitions. Stem has 10 letters. Loop has 38 letters. [2020-07-01 13:17:30,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:17:30,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10065 states and 19991 transitions. [2020-07-01 13:17:30,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2020-07-01 13:17:30,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10065 states to 863 states and 1405 transitions. [2020-07-01 13:17:30,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-07-01 13:17:30,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2020-07-01 13:17:30,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 1405 transitions. [2020-07-01 13:17:30,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:17:30,654 INFO L688 BuchiCegarLoop]: Abstraction has 863 states and 1405 transitions. [2020-07-01 13:17:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 1405 transitions. [2020-07-01 13:17:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 599. [2020-07-01 13:17:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-07-01 13:17:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 859 transitions. [2020-07-01 13:17:30,719 INFO L711 BuchiCegarLoop]: Abstraction has 599 states and 859 transitions. [2020-07-01 13:17:30,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:30,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 13:17:30,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:17:30,724 INFO L87 Difference]: Start difference. First operand 599 states and 859 transitions. Second operand 10 states. [2020-07-01 13:17:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:30,995 INFO L93 Difference]: Finished difference Result 479 states and 637 transitions. [2020-07-01 13:17:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 13:17:30,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 637 transitions. [2020-07-01 13:17:31,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2020-07-01 13:17:31,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 271 states and 377 transitions. [2020-07-01 13:17:31,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2020-07-01 13:17:31,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2020-07-01 13:17:31,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 377 transitions. [2020-07-01 13:17:31,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:17:31,012 INFO L688 BuchiCegarLoop]: Abstraction has 271 states and 377 transitions. [2020-07-01 13:17:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 377 transitions. [2020-07-01 13:17:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 227. [2020-07-01 13:17:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-07-01 13:17:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 304 transitions. [2020-07-01 13:17:31,022 INFO L711 BuchiCegarLoop]: Abstraction has 227 states and 304 transitions. [2020-07-01 13:17:31,023 INFO L591 BuchiCegarLoop]: Abstraction has 227 states and 304 transitions. [2020-07-01 13:17:31,023 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 13:17:31,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 304 transitions. [2020-07-01 13:17:31,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2020-07-01 13:17:31,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:31,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:31,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:31,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:17:31,026 INFO L794 eck$LassoCheckResult]: Stem: 19284#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] 19285#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]< 19286#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] 19418#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[] 19401#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]< 19403#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] 19416#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] 19414#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19413#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] 19409#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]< 19412#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] 19476#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[] 19290#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]< 19478#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] 19308#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[] 19279#L11 [2020-07-01 13:17:31,027 INFO L796 eck$LassoCheckResult]: Loop: 19279#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]< 19304#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] 19308#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[] 19279#L11 [2020-07-01 13:17:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1794805415, now seen corresponding path program 4 times [2020-07-01 13:17:31,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:31,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202057687] [2020-07-01 13:17:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:17:31,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202057687] [2020-07-01 13:17:31,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:17:31,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:17:31,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460525462] [2020-07-01 13:17:31,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:17:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 59402, now seen corresponding path program 3 times [2020-07-01 13:17:31,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:31,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17188186] [2020-07-01 13:17:31,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:31,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:31,133 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:31,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:31,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:31,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:31,133 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:17:31,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:31,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:31,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:31,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 13:17:31,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:31,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:31,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:31,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:31,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:31,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:31,187 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:31,188 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:31,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:31,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:31,198 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:17:31,198 INFO L440 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:31,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:17:31,234 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:31,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:17:31,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:17:43,345 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-01 13:17:43,350 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:17:43,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:17:43,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:17:43,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:17:43,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:17:43,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:17:43,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:17:43,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 13:17:43,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:17:43,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:17:43,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:43,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:43,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:43,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:17:43,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:17:43,403 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,406 INFO L120 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-07-01 13:17:43,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:43,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:43,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:43,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:43,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:43,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:43,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:43,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,444 INFO L120 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-07-01 13:17:43,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:43,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:43,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:43,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:43,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:43,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:43,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:43,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,483 INFO L120 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-07-01 13:17:43,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:43,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:43,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:43,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:43,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:43,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:43,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:43,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,521 INFO L120 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-07-01 13:17:43,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:17:43,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:17:43,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:17:43,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:17:43,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:17:43,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:17:43,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:17:43,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:17:43,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:17:43,532 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:17:43,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:17:43,538 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:17:43,538 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:17:43,538 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2020-07-01 13:17:43,568 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:17:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:43,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 13:17:43,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:43,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:17:43,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:43,749 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:17:43,749 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 13:17:43,749 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-07-01 13:17:43,750 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 227 states and 304 transitions. cyclomatic complexity: 82 Second operand 5 states. [2020-07-01 13:17:55,206 WARN L192 SmtUtils]: Spent 11.34 s on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-07-01 13:18:05,391 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 227 states and 304 transitions. cyclomatic complexity: 82. Second operand 5 states. Result 362 states and 470 transitions. Complement of second has 31 states. [2020-07-01 13:18:05,393 INFO L141 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-07-01 13:18:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 13:18:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-01 13:18:05,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-01 13:18:05,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:18:05,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-01 13:18:05,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:18:05,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-01 13:18:05,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:18:05,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 470 transitions. [2020-07-01 13:18:05,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2020-07-01 13:18:05,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 244 states and 337 transitions. [2020-07-01 13:18:05,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2020-07-01 13:18:05,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2020-07-01 13:18:05,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 337 transitions. [2020-07-01 13:18:05,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:18:05,407 INFO L688 BuchiCegarLoop]: Abstraction has 244 states and 337 transitions. [2020-07-01 13:18:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 337 transitions. [2020-07-01 13:18:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2020-07-01 13:18:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-07-01 13:18:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 322 transitions. [2020-07-01 13:18:05,416 INFO L711 BuchiCegarLoop]: Abstraction has 235 states and 322 transitions. [2020-07-01 13:18:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:18:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:18:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:18:05,417 INFO L87 Difference]: Start difference. First operand 235 states and 322 transitions. Second operand 8 states. [2020-07-01 13:18:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:18:05,572 INFO L93 Difference]: Finished difference Result 274 states and 385 transitions. [2020-07-01 13:18:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:18:05,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 385 transitions. [2020-07-01 13:18:05,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2020-07-01 13:18:05,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 272 states and 380 transitions. [2020-07-01 13:18:05,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2020-07-01 13:18:05,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2020-07-01 13:18:05,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 380 transitions. [2020-07-01 13:18:05,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:18:05,583 INFO L688 BuchiCegarLoop]: Abstraction has 272 states and 380 transitions. [2020-07-01 13:18:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 380 transitions. [2020-07-01 13:18:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 239. [2020-07-01 13:18:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-01 13:18:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2020-07-01 13:18:05,592 INFO L711 BuchiCegarLoop]: Abstraction has 239 states and 321 transitions. [2020-07-01 13:18:05,593 INFO L591 BuchiCegarLoop]: Abstraction has 239 states and 321 transitions. [2020-07-01 13:18:05,593 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 13:18:05,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 321 transitions. [2020-07-01 13:18:05,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2020-07-01 13:18:05,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:18:05,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:18:05,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 3, 3, 3, 3, 3, 3, 1, 1] [2020-07-01 13:18:05,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:18:05,596 INFO L794 eck$LassoCheckResult]: Stem: 20520#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] 20521#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]< 20522#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] 20618#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[] 20625#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]< 20629#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] 20674#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] 20673#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20671#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] 20633#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]< 20636#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] 20666#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[] 20668#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]< 20669#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] 20672#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] 20670#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20667#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] 20664#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]< 20665#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] 20688#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[] 20690#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]< 20531#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] 20693#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] 20692#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20689#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] 20686#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]< 20550#mc91ENTRY [2020-07-01 13:18:05,597 INFO L796 eck$LassoCheckResult]: Loop: 20550#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] 20696#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[] 20691#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]< 20531#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] 20693#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] 20692#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20689#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] 20682#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]< 20550#mc91ENTRY [2020-07-01 13:18:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:18:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1239756499, now seen corresponding path program 5 times [2020-07-01 13:18:05,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:18:05,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432351024] [2020-07-01 13:18:05,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:18:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:18:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:18:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash 725061960, now seen corresponding path program 1 times [2020-07-01 13:18:05,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:18:05,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450900814] [2020-07-01 13:18:05,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:18:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:18:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:18:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1406022118, now seen corresponding path program 6 times [2020-07-01 13:18:05,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:18:05,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439912006] [2020-07-01 13:18:05,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:18:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:05,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:18:05,758 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:18:05,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:18:05,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:18:05,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:18:05,758 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:18:05,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:18:05,759 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:18:05,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:18:05,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 13:18:05,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:18:05,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:18:05,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:18:05,824 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:18:05,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:18:05,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:18:05,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:18:05,836 INFO L440 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:18:05,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:18:05,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:18:05,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:18:05,874 INFO L440 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:18:05,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:18:05,908 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:18:05,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:18:05,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:18:05,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:18:05,982 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:18:05,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:18:05,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:18:05,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:18:05,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:18:05,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:18:05,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:18:05,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:18:05,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 13:18:05,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:18:05,983 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:18:05,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:05,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:06,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:06,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:18:06,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:18:06,048 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:18:06,053 INFO L120 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-07-01 13:18:06,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:18:06,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:18:06,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:18:06,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:18:06,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:18:06,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:18:06,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:18:06,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:18:06,094 INFO L120 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-07-01 13:18:06,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:18:06,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:18:06,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:18:06,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:18:06,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:18:06,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:18:06,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:18:06,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:18:06,133 INFO L120 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-07-01 13:18:06,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:18:06,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:18:06,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:18:06,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:18:06,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:18:06,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:18:06,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:18:06,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:18:06,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:18:06,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:18:06,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:18:06,151 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:18:06,151 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:18:06,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 201 Supporting invariants [] [2020-07-01 13:18:06,181 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:18:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:18:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:18:06,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-01 13:18:06,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:18:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:18:06,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 13:18:06,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:18:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:18:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:16,701 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:18:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:18:16,714 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:18:16,715 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 13:18:16,715 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-07-01 13:18:16,715 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 239 states and 321 transitions. cyclomatic complexity: 88 Second operand 9 states. [2020-07-01 13:18:48,629 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 239 states and 321 transitions. cyclomatic complexity: 88. Second operand 9 states. Result 3959 states and 5768 transitions. Complement of second has 174 states. [2020-07-01 13:18:48,632 INFO L141 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-07-01 13:18:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:18:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-07-01 13:18:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 26 letters. Loop has 8 letters. [2020-07-01 13:18:48,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:18:48,634 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-01 13:18:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:18:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:18:48,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-01 13:18:48,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:18:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:18:48,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 13:18:48,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:18:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:18:54,041 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-07-01 13:18:54,042 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 239 states and 321 transitions. cyclomatic complexity: 88 Second operand 9 states. [2020-07-01 13:19:35,399 WARN L192 SmtUtils]: Spent 5.06 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-01 13:20:11,722 WARN L192 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2020-07-01 13:20:16,845 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 239 states and 321 transitions. cyclomatic complexity: 88. Second operand 9 states. Result 629 states and 792 transitions. Complement of second has 95 states. [2020-07-01 13:20:16,885 INFO L141 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-07-01 13:20:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:20:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2020-07-01 13:20:16,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 8 letters. [2020-07-01 13:20:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:20:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 34 letters. Loop has 8 letters. [2020-07-01 13:20:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:20:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 26 letters. Loop has 16 letters. [2020-07-01 13:20:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:20:16,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 629 states and 792 transitions. [2020-07-01 13:20:16,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-07-01 13:20:16,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 629 states to 256 states and 358 transitions. [2020-07-01 13:20:16,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-07-01 13:20:16,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2020-07-01 13:20:16,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 358 transitions. [2020-07-01 13:20:16,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:20:16,898 INFO L688 BuchiCegarLoop]: Abstraction has 256 states and 358 transitions. [2020-07-01 13:20:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 358 transitions. [2020-07-01 13:20:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2020-07-01 13:20:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-01 13:20:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 309 transitions. [2020-07-01 13:20:16,906 INFO L711 BuchiCegarLoop]: Abstraction has 229 states and 309 transitions. [2020-07-01 13:20:16,906 INFO L591 BuchiCegarLoop]: Abstraction has 229 states and 309 transitions. [2020-07-01 13:20:16,906 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 13:20:16,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 309 transitions. [2020-07-01 13:20:16,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-07-01 13:20:16,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:20:16,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:20:16,910 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-07-01 13:20:16,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 4, 3, 3, 3, 2, 2] [2020-07-01 13:20:16,911 INFO L794 eck$LassoCheckResult]: Stem: 25884#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] 25885#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]< 25886#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] 25930#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[] 25927#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]< 25928#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] 25929#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[] 25915#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]< 25914#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] 25916#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] 26001#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26000#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] 25994#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]< 25993#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] 25995#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] 26031#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26029#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] 26027#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] 26026#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26023#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] 26022#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]< 26030#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] 26055#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[] 25936#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]< 25913#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] 26061#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[] 25943#L11 [2020-07-01 13:20:16,911 INFO L796 eck$LassoCheckResult]: Loop: 25943#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]< 25946#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] 25991#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[] 25944#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]< 25946#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] 25991#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[] 25944#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]< 25945#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] 26062#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] 25984#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 25942#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] 25933#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]< 25937#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] 26071#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] 26068#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 25931#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] 25935#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] 25961#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26007#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] 26009#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]< 26076#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] 26079#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] 26078#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26075#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] 26051#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] 26074#mc91FINAL [33] mc91FINAL-->mc91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26024#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] 25908#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]< 25890#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] 25998#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[] 25903#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]< 25913#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] 26061#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[] 25943#L11 [2020-07-01 13:20:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:20:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 282172828, now seen corresponding path program 2 times [2020-07-01 13:20:16,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:20:16,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88916750] [2020-07-01 13:20:16,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:20:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-01 13:20:17,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88916750] [2020-07-01 13:20:17,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:20:17,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 13:20:17,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307877403] [2020-07-01 13:20:17,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:20:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:20:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash -672784141, now seen corresponding path program 2 times [2020-07-01 13:20:17,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:20:17,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739298709] [2020-07-01 13:20:17,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:20:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:20:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-01 13:20:17,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739298709] [2020-07-01 13:20:17,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146702598] [2020-07-01 13:20:17,493 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:20:17,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:20:17,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:20:17,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 13:20:17,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:20:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-01 13:20:17,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:20:17,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 15 [2020-07-01 13:20:17,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023980976] [2020-07-01 13:20:17,593 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:20:17,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:20:17,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 13:20:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:20:17,594 INFO L87 Difference]: Start difference. First operand 229 states and 309 transitions. cyclomatic complexity: 85 Second operand 9 states. [2020-07-01 13:20:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:20:18,144 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-01 13:20:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 13:20:18,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2020-07-01 13:20:18,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:20:18,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2020-07-01 13:20:18,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 13:20:18,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 13:20:18,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 13:20:18,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:20:18,151 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:20:18,151 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:20:18,151 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:20:18,151 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 13:20:18,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:20:18,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:20:18,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 13:20:18,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:20:18 BasicIcfg [2020-07-01 13:20:18,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:20:18,160 INFO L168 Benchmark]: Toolchain (without parser) took 175419.43 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 454.6 MB). Free memory was 562.9 MB in the beginning and 788.1 MB in the end (delta: -225.3 MB). Peak memory consumption was 229.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,160 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:20:18,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.13 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 562.9 MB in the beginning and 642.9 MB in the end (delta: -80.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.63 ms. Allocated memory is still 679.0 MB. Free memory was 642.9 MB in the beginning and 640.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,161 INFO L168 Benchmark]: Boogie Preprocessor took 15.74 ms. Allocated memory is still 679.0 MB. Free memory was 640.7 MB in the beginning and 639.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,162 INFO L168 Benchmark]: RCFGBuilder took 208.16 ms. Allocated memory is still 679.0 MB. Free memory was 639.6 MB in the beginning and 625.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,162 INFO L168 Benchmark]: BlockEncodingV2 took 65.83 ms. Allocated memory is still 679.0 MB. Free memory was 625.0 MB in the beginning and 620.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,163 INFO L168 Benchmark]: TraceAbstraction took 160.71 ms. Allocated memory is still 679.0 MB. Free memory was 620.7 MB in the beginning and 609.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,164 INFO L168 Benchmark]: BuchiAutomizer took 174659.27 ms. Allocated memory was 679.0 MB in the beginning and 1.1 GB in the end (delta: 425.2 MB). Free memory was 609.9 MB in the beginning and 788.1 MB in the end (delta: -178.3 MB). Peak memory consumption was 246.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:20:18,167 INFO L336 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 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 271.13 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 562.9 MB in the beginning and 642.9 MB in the end (delta: -80.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.63 ms. Allocated memory is still 679.0 MB. Free memory was 642.9 MB in the beginning and 640.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 15.74 ms. Allocated memory is still 679.0 MB. Free memory was 640.7 MB in the beginning and 639.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 208.16 ms. Allocated memory is still 679.0 MB. Free memory was 639.6 MB in the beginning and 625.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 65.83 ms. Allocated memory is still 679.0 MB. Free memory was 625.0 MB in the beginning and 620.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 160.71 ms. Allocated memory is still 679.0 MB. Free memory was 620.7 MB in the beginning and 609.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 174659.27 ms. Allocated memory was 679.0 MB in the beginning and 1.1 GB in the end (delta: 425.2 MB). Free memory was 609.9 MB in the beginning and 788.1 MB in the end (delta: -178.3 MB). Peak memory consumption was 246.9 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. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, 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 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 32 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 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 174.6s and 7 iterations. TraceHistogramMax:7. Analysis of lassos took 16.7s. Construction of modules took 76.5s. Büchi inclusion checks took 80.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 383 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 239 states and ocurred in iteration 4. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/22 HoareTripleCheckerStatistics: 123 SDtfs, 215 SDslu, 191 SDs, 0 SdLazy, 712 SolverSat, 251 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 76.5s 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: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 13:17:19.479 ----------------------------------------------- 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/BenchExec_run_eeVyE7/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:20:18.800 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check